Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
نویسندگان
چکیده
منابع مشابه
Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
We propose a method for solving nonlinear second-order cone programs (SOCPs), based on a continuously differentiable exact penalty function. The construction of the penalty function is given by incorporating a multipliers estimate in the augmented Lagrangian for SOCPs. Under the nondegeneracy assumption and the strong second-order sufficient condition, we show that a generalized Newton method h...
متن کاملDi erentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
We propose a method to solve nonlinear second-order cone programs (SOCPs), based on a continuously di erentiable exact penalty function. The construction of the penalty function is given by incorporating a multipliers estimate in the augmented Lagrangian for SOCPs. Under the nondegeneracy assumption and the strong second-order su cient condition, we show that a generalized Newton method has glo...
متن کاملA second-order differentiable smoothing approximation lower order exact penalty function
In this paper, we give a smoothing approximation to the lower order exact penalty functions for inequality-constrained optimization problems. Error estimations are obtained among the optimal objective function values of the smoothed penalty problem, of the nonsmooth penalty problem and of the original optimization problem. An algorithm based on the smoothed penalty function is presented, which ...
متن کاملFirst- and Second-Order Necessary Conditions Via Exact Penalty Functions
In this paper we study firstand second-order necessary conditions for nonlinear programming problems from the viewpoint of exact penalty functions. By applying the variational description of regular subgradients, we first establish necessary and sufficient conditions for a penalty term to be of KKT-type by using the regular subdifferential of the penalty term. In terms of the kernel of the subd...
متن کاملAn SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which the constraints involve linear approximations of the constraint functions in the original problem and the objective function is a convex quadratic function. Those subproblems can be transformed into linear SOCP problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2012
ISSN: 1052-6234,1095-7189
DOI: 10.1137/110852401