A new approach to constrained optimization via image space analysis
From MaRDI portal
Publication:259797
DOI10.1007/s11117-015-0343-7zbMath1333.90100OpenAlexW837273745MaRDI QIDQ259797
Publication date: 18 March 2016
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-015-0343-7
saddle pointimage space analysisgeneralized Lagrangianlinear and nonlinear separationscalarization of vector optimization
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25)
Related Items (7)
Constrained extremum problems and image space analysis. I: Optimality conditions ⋮ Image space analysis for set optimization problems with applications ⋮ Nonlinear separation in the image space with applications to constrained optimization ⋮ Optimality Conditions for Multiobjective Optimization Problems via Image Space Analysis ⋮ Optimality and error bound for set optimization with application to uncertain multi-objective programming ⋮ Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis ⋮ Optimality conditions for efficient solutions of nonconvex constrained multiobjective optimization problems via image space analysis
Cites Work
- Unnamed Item
- Unnamed Item
- On maximum and variational principles via image space analysis
- Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions
- A unified approach for constrained extremum problems: image space analysis
- Unified duality theory for constrained extremum problems. I: Image space analysis
- Vector variational-like inequalities with constraints: separation and alternative
- Image space analysis and scalarization of multivalued optimization
- Image space approach to penalty methods
- Regularity conditions for constrained extremum problems via image space
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Characterizations of convex and quasiconvex set-valued maps
- Near-subconvexlikeness in vector optimization with set-valued functions
- Theorems of the alternative and optimality conditions
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Vector Optimization
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- A characterization of quasiconvex vector-valued functions
This page was built for publication: A new approach to constrained optimization via image space analysis
