Zero duality gap for a class of nonconvex optimization problems
From MaRDI portal
Publication:1897453
By an equivalent transformation using the \(p\)th power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.
Recommendations
- A Nonconvex Duality with Zero Gap and Applications
- scientific article; zbMATH DE number 432981
- Strong duality in optimization: shifted power reformulation
- Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
Cites work
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- Convexification procedures and decomposition methods for nonconvex optimization problems
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Multiplier and gradient methods
- Multiplier methods: A survey
- The multiplier method of Hestenes and Powell applied to convex programming
Cited in
(58)- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
- Properties of saddle points for generalized augmented Lagrangian
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- Exponential transformation in convexifying a noninferior frontier and exponential generating method
- Local saddle points and convexification for nonconvex optimization problems
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Duality gaps in nonconvex stochastic optimization
- Exact penalty function and asymptotic strong nonlinear duality in integer programming
- Value-estimation function method for constrained global optimization
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- A nonlinear Lagrangian dual for integer programming
- Saddle point and exact penalty representation for generalized proximal Lagrangians
- On saddle points in nonconvex semi-infinite programming
- Existence of local saddle points for a new augmented Lagrangian function
- Local convexification of the Lagrangian function in nonconvex optimization
- Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization
- A survey of hidden convex optimization
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function
- Local saddle point and a class of convexification methods for nonconvex optimization problems
- Unified nonlinear Lagrangian approach to duality and optimal paths
- Towards strong duality in integer programming
- On convexification for a class of global optimization problems
- Strong duality in optimization: shifted power reformulation
- Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals
- A note on the existence of saddle points of p-th power Lagrangian for constrained nonconvex optimization
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- Zero duality gap and attainment with possibly non-convex data
- Some nonlinear Lagrange and penalty functions for problems with a single constraint
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- scientific article; zbMATH DE number 4049394 (Why is no real title available?)
- Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs
- On zero duality gap in nonconvex quadratic programming problems
- Saddle point generation in nonlinear nonconvex optimization
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- A tutorial note on a convexification procedure in non-convex semi-infinite optimization
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
- The rate of convergence of a NLM based on F-B NCP for constrained optimization problems without strict complementarity
- Multipliers and general Lagrangians
- A class of nonlinear Lagrangians for nonconvex second order cone programming
- Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization
- Convexification and concavification for a general class of global optimization problems
- On duality gap with polynomial multipliers for polynomial optimization problems
- Nonlinear Lagrangian theory for nonconvex optimization.
- Efficiency and approachability of nonconvex bicriteria programs
- Extended Lagrange and penalty functions in optimization
- A p-power neurodynamic approach to distributed nonconvex optimization
- Lossless convexification and duality
- Saddle points of general augmented Lagrangians for constrained nonconvex optimization
- Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Unified theory of augmented Lagrangian methods for constrained global optimization
- Some convex programs without a duality gap
- Separation approach for augmented lagrangians in Constrained nonconvex optimization
This page was built for publication: Zero duality gap for a class of nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897453)
