Optimality conditions for nonsmooth semidefinite programming via convexificators
From MaRDI portal
Publication:2355132
DOI10.1007/s11117-014-0292-6zbMath1342.90124OpenAlexW2056787585MaRDI QIDQ2355132
M. Golestani, Soghra Nobakhtian
Publication date: 21 July 2015
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-014-0292-6
Related Items (2)
Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints
Cites Work
- Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
- Optimality and duality results for bilevel programming problem using convexifactors
- Convexificators and strong Kuhn-Tucker conditions
- Successive linearization methods for nonlinear semidefinite programs
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Hunting for a smaller convex subdifferential
- Semidefinite programming in combinatorial optimization
- Generalized separation theorems and the Farkas' lemma
- Nonsmooth multiobjective programming and constraint qualifications
- Semidefinite optimization
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Linear Matrix Inequalities in System and Control Theory
- Variational Analysis
- Convexifactors, generalized convexity and vector optimization
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Nonlinear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions for nonsmooth semidefinite programming via convexificators
