Strong Duality in Cone Constrained Nonconvex Optimization
From MaRDI portal
Publication:5300521
DOI10.1137/120861400zbMath1285.90077OpenAlexW2058439838MaRDI QIDQ5300521
Fabián Flores-Bazan, Giandomenico Mastroeni
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120861400
nonconvex optimizationstrong dualityLagrangian dualityquasi-relative interiorsaddle points of the Lagrangian
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items
Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors ⋮ Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ Quasi-relative interiors for graphs of convex set-valued mappings ⋮ Image convexity of generalized systems with infinite-dimensional image and applications ⋮ Set-valued systems with infinite-dimensional image and applications ⋮ First- and second-order optimality conditions for quadratically constrained quadratic programming problems ⋮ Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis ⋮ Constrained extremum problems, regularity conditions and image space analysis. I: The scalar finite-dimensional case ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Generalized differentiation and duality in infinite dimensions under polyhedral convexity ⋮ Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications ⋮ Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ On epsilon-stability in optimization ⋮ Connections between mean-field game and social welfare optimization ⋮ Optimality conditions for strong vector equilibrium problems under a weak constraint qualification ⋮ Unnamed Item ⋮ Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization ⋮ A generalization of multiplier rules for infinite-dimensional optimization problems
