Strong duality for generalized convex optimization problems
From MaRDI portal
Strong duality for nearly-convex optimization problems is established. Three kinds of conjugate dual problems are associated to the primal optimization problem: the Langrange dual, Fenchel dual, and Fenchel-Lagrange dual problems. The main result shows that, under suitable conditions (constraint qualifications), the optimal objective values of these four problems coincide.
Recommendations
- Strong duality for standard convex programs
- Generalized polyhedral convex optimization problems
- The Fenchel-Lagrange dual of generalized convex optimization problem
- Generalized constraints qualification conditions and infinite dimensional duality
- Conjugate duality for generalized convex optimization problems
Cites work
Cited in
(52)- Some Farkas-type results for fractional programming problems with DC functions
- Different conjugate dual problems in vector optimization and their relations
- Conjugate duality in convex optimization
- Strong duality of the general capacity problem in metric spaces
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
- Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
- Strong duality for generalized monotropic programming in infinite dimensions
- Generalized polyhedral convex optimization problems
- Strong duality and optimality conditions for generalized equilibrium problems
- Strong duality for standard convex programs
- On strong duality in linear copositive programming
- The value of cooperation in interregional transmission planning: a noncooperative equilibrium model approach
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- Farkas-type results for fractional programming problems
- Conjugate dual problems in constrained set-valued optimization and applications
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- New constraint qualification and conjugate duality for composed convex optimization problems
- Conjugate duality for generalized convex optimization problems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Gap functions for generalized vector equilibrium problems via conjugate duality and applications
- The duality framework for constrained optimization problems
- Conjugate duality in constrained set-valued vector optimization problems
- scientific article; zbMATH DE number 5944598 (Why is no real title available?)
- On the strong concavity of the dual function of an optimization problem
- The Fenchel-Lagrange dual of generalized convex optimization problem
- scientific article; zbMATH DE number 4149024 (Why is no real title available?)
- Radiant and coradiant dualities
- A closedness condition and its applications to DC programs with convex constraints
- scientific article; zbMATH DE number 29898 (Why is no real title available?)
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- scientific article; zbMATH DE number 7294847 (Why is no real title available?)
- New duality results for evenly convex optimization problems
- Near equality and almost convexity of functions with applications to optimization and error bounds
- Scalar and vector optimization with composed objective functions and constraints
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- Strong duality in cone constrained nonconvex optimization
- Optimality conditions of vector set-valued optimization problem involving relative interior
- Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality
- Lagrangian duality in convex conic programming with simple proofs
- Farkas-type results for max-functions and applications
- Saddle points and gap functions for vector equilibrium problems via conjugate duality in vector optimization
- Some new Farkas-type results for inequality systems with DC functions
- Comments on ``Dual methods for nonconvex spectrum optimization of multicarrier systems
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
- Fenchel's duality theorem for nearly convex functions
- Duality for almost convex optimization problems via the perturbation approach
This page was built for publication: Strong duality for generalized convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948630)
