Lagrangian approach to quasiconvex programing
From MaRDI portal
Publication:1411530
DOI10.1023/A:1023957924086zbMath1043.90072OpenAlexW36374308MaRDI QIDQ1411530
Publication date: 29 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023957924086
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Multipliers and general Lagrangians ⋮ Generalized affine functions and generalized differentials ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ Are dualities appropriate for duality theories in optimization? ⋮ Representation of generalized monotone multimaps ⋮ Generalized convex functions and generalized differentials ⋮ Projective dualities for quasiconvex problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower subdifferentiable functions and their minimization by cutting planes
- Duality for radiant and shady programs
- Characterization of solution sets of quasiconvex programs
- Lower subdifferentiability and integration
- Surrogate Programming and Multipliers in Quasi-convex Programming
- What is quasiconvex analysis?
- Quasi-Convex Programming
- The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
- On Quasi-Convex Duality
- Sufficient conditions for extremum, penalty functions and regularity
- Abstract convexity and global optimization
This page was built for publication: Lagrangian approach to quasiconvex programing