Feb 6, 2015 · This study addresses the solution of large-scale, non-convex optimization problems with fixed and linear variable costs in the objective ...
This study addresses the solution of large-scale, non-convex optimization problems with fixed and linear variable costs in the objective function and a set ...
This study addresses the solution of large-scale, non-convex optimization problems with fixed and linear variable costs in the objective function and a set ...
A successive smoothing algorithm (SSA) is developed to solve a non-convex optimization problem by solving a sequence of approximated convex problems. The ...
Successive smoothing algorithm for solving large-scale optimization models with fixed cost. Mashor Housh; Ximing Cai ...
Successive smoothing algorithm for solving large-scale optimization models with fixed cost. ; Housh, Mashor; Cai, Ximing ...
Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow ...
Missing: fixed | Show results with:fixed
In this paper, we propose an efficient approach for solving a class of large-scale convex optimization problems. The problem we consider is the minimization ...
Missing: cost. | Show results with:cost.
We introduce a smoothing technique for nondifferentiable optimization problems. The approach is to replace the original problem by an approximate one which ...
Abstract. We study a class of linear programming (LP) problems motivated by large-scale machine learning applications. After reformulating the LP as a ...
Missing: Successive | Show results with:Successive