Zero duality gaps in infinite-dimensional programming
From MaRDI portal
We study the following infinite-dimensional programming problem \[ (P)\quad \mu:=\inf f_ 0(x),\quad subject\quad to\quad x\in C,\quad f_ i(x)\leq,\quad i\in I, \] where I is an index set with possibly infinite cardinality and C is an infinite-dimensional set. Zero duality gap results are presented under suitable regularity hypotheses for convex- like (nonconvex) and convex infinitely constrained programs (P). Various properties of the value function of the convex-like program and its connections to the regularity hypotheses are studied. Relationships between the zero duality gap property, semicontinuity, and \(\epsilon\)- subdifferentiability of the value function are examined. In particular, a characterization for the value function without convexity is given, using the \(\epsilon\)-subdifferential of the value function.
Recommendations
Cites work
- A duality theorem for semi-infinite convex programs and their finite subprograms
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- A note on perfect duality and limiting lagrangeans
- An Infinite Linear Program with a Duality Gap
- Applying Some Modern Developments to Choosing Your Own Lagrange Multipliers
- Clark's theorem for semi-infinite convex programs
- Classification Schemes for the Strong Duality of Linear Programming Over Cones
- Classifying convex extremum problems over linear topologies having separation properties
- Constructing a perfect duality in infinite programming
- Convexlike alternative theorems and mathematical programming
- Duality and asymptotic solvability over cones
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- scientific article; zbMATH DE number 3812372 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3622401 (Why is no real title available?)
- scientific article; zbMATH DE number 3799420 (Why is no real title available?)
- scientific article; zbMATH DE number 3296906 (Why is no real title available?)
- scientific article; zbMATH DE number 3376983 (Why is no real title available?)
- Linear Programming in Reflexive Spaces
- Minimax Theorems
- Nonconvex theorems of the alternative and minimization
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Optimization and nonsmooth analysis
- Uniform duality in semi-infinite convex optimization
Cited in
(42)- Duality gap of the conic convex constrained optimization problems in normed spaces
- In a semi-infinite program only a countable subset of the constraints is essential
- Generalizations of Slater's constraint qualification for infinite convex programs
- Infinite-dimensional convex programming with applications to constrained approximation
- Semicontinuity and quasiconvex functions
- Conjugate duality in set-valued vector optimization
- On convex generalized systems
- Stability of the duality gap in linear optimization
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Ensuring privacy with constrained additive noise by minimizing Fisher information
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions
- Invex-convexlike functions and duality
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
- Stable zero Lagrange duality for DC conic programming
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- Min-sup-type zero duality gap properties for DC composite optimization problem
- On the duality gap and Gale's example in infinite-dimensional conic linear programming
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- On the existence of a saddle value
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- A solvability theorem and minimax fractional programming
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- A solution method for combined semi-infinite and semi-definite programming
- Extended Lagrange And Penalty Functions in Continuous Optimization*
- New glimpses on convex infinite optimization duality
- Duality for optimization problems with infinite sums
- On duality gap with polynomial multipliers for polynomial optimization problems
- Nonlinear Lagrangian theory for nonconvex optimization.
- Duality gap function in infinite dimensional linear programming
- On a zero duality gap result in extended monotropic programming
- On epsilon-stability in optimization
- Convex composite multi-objective nonsmooth programming
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Inequality systems and optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Some applications of the image space analysis to the duality theory for constrained extremum problems
This page was built for publication: Zero duality gaps in infinite-dimensional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263531)
