Strong duality in cone constrained nonconvex optimization
From MaRDI portal
Recommendations
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Strong duality for standard convex programs
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Strong duality for generalized convex optimization problems
Cited in
(49)- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Set-valued systems with infinite-dimensional image and applications
- 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
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Approximate optimality conditions for composite convex optimization problems
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- Strong duality for standard convex programs
- First- and second-order optimality conditions for quadratically constrained quadratic programming problems
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- Connections between mean-field game and social welfare optimization
- Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- The strong conical hull intersection property for convex programming
- Optimality conditions for strong vector equilibrium problems under a weak constraint qualification
- Generalized differentiation and duality in infinite dimensions under polyhedral convexity
- Duality for sets of strong Slater points
- Characterizations of improvement sets via quasi interior and applications in vector optimization
- Strong duality in optimization: shifted power reformulation
- Non-convex strong duality via subdifferential
- Image convexity of generalized systems with infinite-dimensional image and applications
- On duality with strong pseudoinvexity over cone domain
- Characterizing FJ and KKT conditions in nonconvex mathematical programming with applications
- On the strong concavity of the dual function of an optimization problem
- Remarks on general infinite dimensional duality with cone and equality constraints
- Strong Core Theorems with Nonconvex Preferences
- Asymptotic strong duality
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- 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
- scientific article; zbMATH DE number 7377700 (Why is no real title available?)
- A generalization of multiplier rules for infinite-dimensional optimization problems
- scientific article; zbMATH DE number 7194401 (Why is no real title available?)
- Necessary and sufficient conditions for Farkas' Lemma for cone systems and second-order cone programming duality
- Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
- Image regularity conditions for nonconvex multiobjective optimization problems with applications
- Lossless convexification and duality
- On epsilon-stability in optimization
- Characterization of generalized FJ and KKT conditions for robust optimization
- Image space analysis to Lagrange duality in nonconvex set optimization
- Image regularity conditions based on nonconvex separation with applications
- On proper separation theorems by means of the quasi-relative interior with applications
- Mas-Colell properness condition and almost convexity in nonconvex optimization
- Convex analysis in groups and semigroups and applications to separation and optimization
- Quasi-relative interiors for graphs of convex set-valued mappings
- Comments on ``Dual methods for nonconvex spectrum optimization of multicarrier systems
- Generalized constraints qualification conditions and infinite dimensional duality
This page was built for publication: Strong duality in cone constrained nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300521)