Pages that link to "Item:Q1897453"

The following pages link to Zero duality gap for a class of nonconvex optimization problems (Q1897453):

Displaying 50 items.

• Generalized Courant-Beltrami penalty functions and zero duality gap for conic convex programs (Q395589) (← links)
• On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
• A class of nonlinear Lagrangians for nonconvex second order cone programming (Q540625) (← links)
• Convexification and concavification for a general class of global optimization problems (Q556003) (← links)
• Saddle points of general augmented Lagrangians for constrained nonconvex optimization (Q695341) (← links)
• Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property (Q721143) (← links)
• Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming (Q743964) (← links)
• Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
• Unified theory of augmented Lagrangian methods for constrained global optimization (Q839330) (← links)
• Some convex programs without a duality gap (Q959958) (← links)
• Separation approach for augmented lagrangians in Constrained nonconvex optimization (Q963656) (← links)
• The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization (Q1004224) (← links)
• Properties of saddle points for generalized augmented Lagrangian (Q1014294) (← links)
• On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization (Q1174434) (← links)
• Exponential transformation in convexifying a noninferior frontier and exponential generating method (Q1273169) (← links)
• Local saddle points and convexification for nonconvex optimization problems (Q1369054) (← links)
• Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
• Duality gaps in nonconvex stochastic optimization (Q1764248) (← links)
• Exact penalty function and asymptotic strong nonlinear duality in integer programming (Q1780321) (← links)
• Value-estimation function method for constrained global optimization (Q1807822) (← links)
• Zero duality gap in integer programming: \(P\)-norm surrogate constraint method (Q1807931) (← links)
• A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
• Saddle point and exact penalty representation for generalized proximal Lagrangians (Q1928261) (← links)
• On saddle points in nonconvex semi-infinite programming (Q1928307) (← links)
• Existence of local saddle points for a new augmented Lagrangian function (Q1958815) (← links)
• Local convexification of the Lagrangian function in nonconvex optimization (Q1973484) (← links)
• Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization (Q2029687) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization (Q2216183) (← links)
• A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems (Q2350402) (← links)
• A nonlinear Lagrangian based on Fischer-Burmeister NCP function (Q2372014) (← links)
• Local saddle point and a class of convexification methods for nonconvex optimization problems (Q2460140) (← links)
• Unified nonlinear Lagrangian approach to duality and optimal paths (Q2465457) (← links)
• Towards strong duality in integer programming (Q2501114) (← links)
• On convexification for a class of global optimization problems (Q2676158) (← links)
• Strong duality in optimization: shifted power reformulation (Q2829558) (← links)
• Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals (Q2830299) (← links)
• A note on the existence of saddle points of<i>p</i>-th power Lagrangian for constrained nonconvex optimization (Q3145048) (← links)
• On Zero Duality Gap and the Farkas Lemma for Conic Programming (Q3169012) (← links)
• Some nonlinear Lagrange and penalty functions for problems with a single constraint (Q3407610) (← links)
• A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM (Q3526524) (← links)
• (Q3786282) (← links)
• Saddle point generation in nonlinear nonconvex optimization (Q4378893) (← links)
• Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization (Q4707432) (← links)
• Extended Lagrange And Penalty Functions in Continuous Optimization^* (Q4943962) (← links)
• (Q5154504) (← links)
• Nonlinear rescaling Lagrangians for nonconvex semidefinite programming (Q5169465) (← links)
• The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity (Q5265452) (← links)
• Multipliers and general Lagrangians (Q5317740) (← links)