A sufficient optimality theoriem for protoconvex programs
From MaRDI portal
Publication:2743663
DOI10.1080/02331930108844544zbMath1007.90067OpenAlexW2021590854MaRDI QIDQ2743663
Publication date: 26 March 2003
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930108844544
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Cites Work
- Unnamed Item
- Weak lower subdifferentials and applications
- Quasi-Concave Programming
- Optimization and nonsmooth analysis
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Quasimonotone Multifunctions; Applications to Optimality Conditions in Quasiconvex Programming
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Protoconvex functions
- Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients
- Convex Analysis
This page was built for publication: A sufficient optimality theoriem for protoconvex programs