Characterizations of approximate solution and approximate duality for quasiconvex programming

Publication date 24 March 2026

Published in Acta Mathematica Scientia. Series A. (Chinese Edition) (Search for Journal in Brave)

Full work available at URL http://actams.apm.ac.cn/sxwlxbA/EN/abstract/abstract17588.shtml

approximate saddle point theorem mixed type duality quasi $(\alpha,\varepsilon)$-optimal solution quasiconvex programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Cites work

$\varepsilon$-Wolfe type duality for convex optimization problems under data uncertainty
Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
Approximate optimality conditions and mixed type duality for composite convex optimization problems
Approximate optimality conditions and mixed type duality for quasiconvex optimization problems
Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
Approximate optimality conditions for composite convex optimization problems
Conjugate duality in convex optimization
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
Generators and constraint qualifications for quasiconvex inequality systems
scientific article; zbMATH DE number 1807400 (Why is no real title available?)
scientific article; zbMATH DE number 1168308 (Why is no real title available?)
Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Minimizing the difference of two quasiconvex functions
New Farkas-type constraint qualifications in convex infinite programming
On -solutions for convex optimization problems with uncertainty data
On approximate solutions and saddle point theorems for robust convex optimization
On constraint qualification for an infinite system of quasiconvex inequalities in normed linear space
On constraint qualifications for an infinite system of quasiconvex inequalities
On mixed duality in mathematical programming.
On quasi $\epsilon$-solution for robust convex optimization problems
On Quasi-Convex Duality
On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization
On set containment characterization and constraint qualification for quasiconvex programming
Optimality conditions and constraint qualifications for quasiconvex programming
Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems
Strong and total Lagrange dualities for quasiconvex programming
Strong and total Lagrange dualities for quasiconvex programming
Wolfe duality and Mond-Weir duality via perturbations

This page was built for publication: Characterizations of approximate solution and approximate duality for quasiconvex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839570)