Strong and total Lagrange dualities for quasiconvex programming
From MaRDI portal
Publication:2336429
DOI10.1155/2014/453912zbMath1442.90142OpenAlexW2134104994WikidataQ59051453 ScholiaQ59051453MaRDI QIDQ2336429
Dong Hui 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
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (8)
A sharp Lagrange multiplier theorem for nonlinear programs ⋮ Nonlinear programming via König's maximum theorem ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Unnamed Item ⋮ Revisiting the Hahn-Banach theorem and nonlinear infinite programming ⋮ Strong and total Lagrange dualities for quasiconvex programming ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- On set containment characterization and constraint qualification for quasiconvex programming
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Set containment characterization for quasiconvex programming
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Farkas-Type Results With Conjugate Functions
- New Farkas-type constraint qualifications in convex infinite programming
- Quasi-Convex Programming
- On Quasi-Convex Duality
This page was built for publication: Strong and total Lagrange dualities for quasiconvex programming
