Characterizations of the solution set for a class of nonsmooth optimization problems
From MaRDI portal
Publication:1947617
DOI10.1007/s11590-012-0471-yzbMath1269.90112OpenAlexW2041389440MaRDI QIDQ1947617
Publication date: 23 April 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0471-y
Related Items (15)
Characterizations of robust solution set of convex programs with uncertain data ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ 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 ⋮ Unnamed Item ⋮ On characterization of solution sets of set-valued pseudoinvex optimization problems ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ 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 approximate solution sets of nonsmooth optimization problems and its applications ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codifferential method for minimizing nonsmooth DC functions
- Generalized pseudolinearity
- Characterizations of the solution sets of convex programs and variational inequality problems
- Some remarks on nonsmooth critical point theory
- On characterizing the solution sets of pseudoinvex extremum problems
- A simple characterization of solutions sets of convex programs
- Generalized convexity of functions and generalized monotonicity of set-valued maps
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- 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
- On characterizing solution set of non-differentiable η-pseudolinear extremum problem
- 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
This page was built for publication: Characterizations of the solution set for a class of nonsmooth optimization problems
