Characterizations of solution sets of nonsmooth mathematical programming problems
From MaRDI portal
Cites work
- A simple characterization of solutions sets of convex programs
- An introduction to the theory of nonsmooth optimization
- Characterization of solution sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Characterizations of solution sets of convex vector minimization problems
- Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Characterizations of the solution sets of convex programs and variational inequality problems
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Codifferential method for minimizing nonsmooth DC functions
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Equilibrium problems: nonsmooth optimization and variational inequality models
- Error bounds for nondegenerate monotone linear complementarity problems
- Generalized pseudolinearity
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing solution set of non-differentiable -pseudolinear extremum problem
- On characterizing the solution sets of pseudoinvex extremum problems
- On characterizing the solution sets of pseudolinear programs
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimization and nonsmooth analysis
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Some characterizations of locally Lipschitz pseudolinear functions
- Some remarks on nonsmooth critical point theory
- Weak Sharp Minima in Mathematical Programming
This page was built for publication: Characterizations of solution sets of nonsmooth mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257063)
