Strong and total Lagrange dualities for quasiconvex programming
From MaRDI portal
Publication:2336429
DOI10.1155/2014/453912zbMATH Open1442.90142OpenAlexW2134104994WikidataQ59051453 ScholiaQ59051453MaRDI QIDQ2336429FDOQ2336429
Authors: D. H. Fang, Xian-Fa Luo, Xian-Yun Wang 
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/453912
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
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Quasi-Convex Duality
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications for semi-infinite systems of convex inequalities
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- New Farkas-type constraint qualifications in convex infinite programming
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- On strong and total Lagrange duality for convex optimization problems
- 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
- From linear to convex systems: consistency, Farkas' lemma and applications
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- On set containment characterization and constraint qualification for quasiconvex programming
- Quasi-Convex Programming
- Farkas-Type Results With Conjugate Functions
- Title not available (Why is that?)
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- 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
- Characterizations of the solution set for tangentially convex optimization problems
- Lagrangian approach to quasiconvex programing
- Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- Radiant and coradiant dualities
- Title not available (Why is that?)
- 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
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Characterizations of the solution set for non-essentially quasiconvex programming
- 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)
