Strong and total Lagrange dualities for quasiconvex programming

DOI10.23952/jnva.6.2022.1.01OpenAlexW4226238011MaRDI QIDQ5088817

Yeong-Cheng Liou, Ting Yang, Dong Hui Fang

Publication date: 13 July 2022

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.6.2022.1.01

zbMATH Keywords

constraint qualificationstrong dualityquasiconvex programmingtotal dualitygenerator of a quasiconvex function

Mathematics Subject Classification ID

Operator theory (47-XX) Functional analysis (46-XX)

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
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• Optimality conditions and constraint qualifications for quasiconvex programming
• Strong and total Lagrange dualities for quasiconvex programming
• On strong and total Lagrange duality for convex optimization problems
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Qualitative properties of the minimum sum-of-squares clustering problem
• Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
• New Farkas-type constraint qualifications in convex infinite programming
• Quasi-Convex Programming
• On Quasi-Convex Duality
• The minimal time function associated with a collection of sets

This page was built for publication: Strong and total Lagrange dualities for quasiconvex programming