The optimality conditions for approximate solutions of quasiconvex programming problems
From MaRDI portal
Publication:5209919
DOI10.3969/J.ISSN.1001-8395.2019.03.008zbMATH Open1449.90296MaRDI QIDQ5209919FDOQ5209919
Authors: Zhihui Xu, Ruiting Chen, Ying Gao 
Publication date: 22 January 2020
Recommendations
- The optimality conditions of approximate solutions for quasiconvex multiobjective optimization problem
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Quasi-convex functions and applications to optimality conditions in nonlinear programming
- Optimality Conditions for Quasiconvex Programs
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
Cited In (11)
- Approximate optimality conditions for minimax programming problems
- The optimality conditions of approximate solutions for quasiconvex multiobjective optimization problem
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
- Optimality via generalized approximate convexity and quasiefficiency
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Title not available (Why is that?)
- Approximate optimality conditions and mixed type duality for quasiconvex optimization problems
- Title not available (Why is that?)
- On sufficient optimality conditions for a quasiconvex programming problem
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
This page was built for publication: The optimality conditions for approximate solutions of quasiconvex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5209919)
