A new approach to characterize the solution set of a pseudoconvex programming problem
From MaRDI portal
Publication:390484
DOI10.1016/j.cam.2013.11.004zbMath1278.90435OpenAlexW2082772700MaRDI QIDQ390484
Publication date: 8 January 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.11.004
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (19)
An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ ϵ-Efficient solutions in semi-infinite multiobjective optimization ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data ⋮ Characterization of radially lower semicontinuous pseudoconvex functions ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ 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
- Unnamed Item
- Characterizations of the solution sets of pseudoinvex programs and variational inequalities
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- On characterizing the solution sets of pseudoinvex extremum problems
- Characterizations of optimal solution sets of convex infinite programs
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- A simple characterization of solutions sets of convex programs
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Characterization of solution sets of quasiconvex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- Characterizations of solution sets of convex vector minimization problems
- Characterization of solution sets of convex programs
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Optimization and nonsmooth analysis
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- New Farkas-type constraint qualifications in convex infinite programming
- Pseudo-Convex Functions
This page was built for publication: A new approach to characterize the solution set of a pseudoconvex programming problem
