Strong and total Lagrange dualities for quasiconvex programming
From MaRDI portal
(Redirected from Publication:2336429)
Summary: We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the \(z\)-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualifications, we provide some necessary and sufficient conditions for infinite quasiconvex optimization problems to have the strong and total Lagrange dualities.
Recommendations
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Optimality conditions and constraint qualifications for quasiconvex programming
- On strong and total Lagrange duality for convex optimization problems
- Total Lagrange duality for DC infinite optimization problems
- Study on the Lagrange dualities for composite optimization problems with conical constraints
Cites work
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Constraint qualifications for semi-infinite systems of convex inequalities
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- Farkas-Type Results With Conjugate Functions
- From linear to convex systems: consistency, Farkas' lemma and applications
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 1369455 (Why is no real title available?)
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- New Farkas-type constraint qualifications in convex infinite programming
- On Quasi-Convex Duality
- On set containment characterization and constraint qualification for quasiconvex programming
- On strong and total Lagrange duality for convex optimization problems
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Quasi-Convex Programming
- Set containment characterization for quasiconvex programming
Cited in
(19)- Lagrangian approach to quasiconvex programing
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- Characterizations of the solution set for non-essentially quasiconvex programming
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- On strong and total Lagrange duality for convex optimization problems
- A sharp Lagrange multiplier theorem for nonlinear programs
- Nonlinear programming via König's maximum theorem
- Radiant and coradiant dualities
- scientific article; zbMATH DE number 3900513 (Why is no real title available?)
- Total Lagrange duality for DC infinite optimization problems
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- Strong and total Lagrange dualities for quasiconvex programming
- Characterizations of the solution set for tangentially convex optimization problems
- Convergence of sequences in generalized topological spaces via filter
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Characterizations of approximate solution and approximate duality for quasiconvex programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
This page was built for publication: Strong and total Lagrange dualities for quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336429)
