Zero duality gap for a class of nonconvex optimization problems
From MaRDI portal
Publication:1897453
DOI10.1007/BF02192229zbMath0829.90109WikidataQ57445571 ScholiaQ57445571MaRDI QIDQ1897453
Publication date: 27 August 1995
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming, A nonlinear Lagrangian based on Fischer-Burmeister NCP function, Unified theory of augmented Lagrangian methods for constrained global optimization, Multipliers and general Lagrangians, Local saddle points and convexification for nonconvex optimization problems, A survey of hidden convex optimization, Saddle point and exact penalty representation for generalized proximal Lagrangians, On saddle points in nonconvex semi-infinite programming, On convexification for a class of global optimization problems, A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM, Existence of local saddle points for a new augmented Lagrangian function, On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization, Local convexification of the Lagrangian function in nonconvex optimization, Local saddle point and a class of convexification methods for nonconvex optimization problems, Unified nonlinear Lagrangian approach to duality and optimal paths, Saddle point generation in nonlinear nonconvex optimization, Separation approach for augmented lagrangians in Constrained nonconvex optimization, Nonlinear rescaling Lagrangians for nonconvex semidefinite programming, Saddle points of general augmented Lagrangians for constrained nonconvex optimization, A class of nonlinear Lagrangians for nonconvex second order cone programming, Convexification and concavification for a general class of global optimization problems, Nonlinear Lagrangian theory for nonconvex optimization., Efficiency and approachability of nonconvex bicriteria programs, Exact penalty function and asymptotic strong nonlinear duality in integer programming, Towards strong duality in integer programming, Extended Lagrange And Penalty Functions in Continuous Optimization*, Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property, Extended Lagrange and penalty functions in optimization, Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization, The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming, Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization, Value-estimation function method for constrained global optimization, Zero duality gap in integer programming: \(P\)-norm surrogate constraint method, Properties of saddle points for generalized augmented Lagrangian, Exponential transformation in convexifying a noninferior frontier and exponential generating method, Strong duality in optimization: shifted power reformulation, Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals, Some nonlinear Lagrange and penalty functions for problems with a single constraint, Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization, Unnamed Item, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems, A note on the existence of saddle points ofp-th power Lagrangian for constrained nonconvex optimization, A nonlinear Lagrangian dual for integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Multiplier methods: A survey
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
