Set-valued systems with infinite-dimensional image and applications
From MaRDI portal
Publication:1626530
DOI10.1007/s10957-016-1041-8zbMath1402.90170OpenAlexW2561978706MaRDI QIDQ1626530
Publication date: 27 November 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-1041-8
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Constrained extremum problems and image space analysis. I: Optimality conditions, Constrained extremum problems and image space analysis. III: Generalized systems, Generalized robust duality in constrained nonconvex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On maximum and variational principles via image space analysis
- Image convexity of generalized systems with infinite-dimensional image and applications
- A unified approach for constrained extremum problems: image space analysis
- Unified duality theory for constrained extremum problems. I: Image space analysis
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- A complete characterization of strong duality in nonconvex optimization with a single constraint
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Separation of sets and Wolfe duality
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Remarks on infinite dimensional duality
- Scalarization approaches for set-valued vector optimization problems and vector variational inequalities
- Theorems of the alternative for multifunctions with applications to optimization: General results
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Notions of relative interior in Banach spaces
- On convex generalized systems
- Separation theorem based on the quasirelative interior and application to duality theory
- Theorems of the alternative and optimality conditions
- Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set
- Infinite dimensional duality and applications
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- On the use of the quasi-relative interior in optimization
- Vector Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- A multivalued approach to the Farkas lemma
- Variational Analysis
- Strong Duality in Cone Constrained Nonconvex Optimization
- Set-valued Optimization
