Necessary and sufficient constraint qualification for surrogate duality
From MaRDI portal
Publication:415371
DOI10.1007/S10957-011-9893-4zbMATH Open1243.90242OpenAlexW1998988522MaRDI QIDQ415371FDOQ415371
Daishi Kuroiwa, Satoshi Suzuki
Publication date: 8 May 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9893-4
Recommendations
- A constraint qualification characterizing surrogate duality for quasiconvex programming
- scientific article; zbMATH DE number 3909181
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Some characterizations of surrogate dual problems
- A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Cites Work
- Conjugate duality in convex optimization
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- An alternative formulation for a new closed cone constraint qualification
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Title not available (Why is that?)
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- Surrogate Mathematical Programming
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- On set containment characterization and constraint qualification for quasiconvex programming
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Surrogate Programming and Multipliers in Quasi-convex Programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Quasi-Convex Programming
- The Generalized Penalty-Function/Surrogate Model
Cited In (12)
- Title not available (Why is that?)
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- On generalized surrogate duality in mixed-integer nonlinear programming
- Duality theorems for separable convex programming without qualifications
- Characterizations of the solution set for tangentially convex optimization problems
- Nonlinear error bounds for quasiconvex inequality systems
- Duality theorems for convex and quasiconvex set functions
- Characterizations of the solution set for non-essentially quasiconvex programming
- Surrogate duality for robust optimization
- Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions and constraint qualifications for quasiconvex programming
This page was built for publication: Necessary and sufficient constraint qualification for surrogate duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415371)
