Strong and total Lagrange dualities for quasiconvex programming
From MaRDI portal
Publication:2336429
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
- 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?)
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications characterizing Lagrangian duality in convex 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
- 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
(18)- On strong and total Lagrange duality for convex optimization problems
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Convergence of sequences in generalized topological spaces via filter
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- A sharp Lagrange multiplier theorem for nonlinear programs
- Lagrangian approach to quasiconvex programing
- Characterizations of the solution set for tangentially convex optimization problems
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- Radiant and coradiant dualities
- scientific article; zbMATH DE number 3900513 (Why is no real title available?)
- Total Lagrange duality for DC infinite optimization problems
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Nonlinear programming via König's maximum theorem
- Characterizations of the solution set for non-essentially quasiconvex programming
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Strong and total Lagrange dualities for quasiconvex 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)
