Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
From MaRDI portal
Publication:2341101
DOI10.1007/s11590-014-0780-4zbMath1342.90186OpenAlexW2067795791MaRDI QIDQ2341101
Publication date: 23 April 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0780-4
Related Items (3)
Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality ⋮ Berge's maximum theorem to vector-valued functions with some applications ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for quasi-solutions of vector optimization problems
- Characterizations of the solution sets of pseudoinvex programs and variational inequalities
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- Optimization and variational inequalities with pseudoconvex functions
- Generalized invariant monotonicity and invexity of non-differentiable functions
- On characterizing the solution sets of pseudoinvex extremum problems
- A simple characterization of solutions sets of convex programs
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- Infinite-dimensional convex programming with applications to constrained approximation
- Generalized invexity and generalized invariant monotonicity
- The generalized optimality conditions of multiobjective programming problem in topological vector space.
- On invex sets and preinvex functions
- On characterizing the solution sets of pseudolinear programs
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Lagrange multiplier rules for approximate solutions in vector optimization
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Characterization of solution sets of convex programs
- Optimization and nonsmooth analysis
- What is invexity?
- Necessary conditions for ε-optimality
- Penalty functions in ε-programming and ε-minimax problems
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
This page was built for publication: Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
