On the use of the quasi-relative interior in optimization

DOI10.1080/02331934.2015.1032284zbMath1337.49060OpenAlexW2041274954MaRDI QIDQ2808318

Constantin Zalinescu

Publication date: 23 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2015.1032284

zbMATH Keywords

constrained optimizationdualitysubdifferentialscalar optimizationset-valued optimizationLagrange functionquasi-relative interiorquasi-interior

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Related Items (14)

Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors ⋮ Quasi-relative interiors for graphs of convex set-valued mappings ⋮ Image convexity of generalized systems with infinite-dimensional image and applications ⋮ Set-valued systems with infinite-dimensional image and applications ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Characterizations via linear scalarization of minimal and properly minimal elements ⋮ On the global shape of convex functions on locally convex spaces ⋮ Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems ⋮ Relationships between polyhedral convex sets and generalized polyhedral convex sets ⋮ The intrinsic core and minimal faces of convex sets in general vector spaces ⋮ Infinite-dimensional vector optimization and a separation theorem ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ On epsilon-stability in optimization ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces

Cites Work

• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
• Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
• The infinite dimensional Lagrange multiplier rule for convex optimization problems
• Revisiting some duality theorems via the quasirelative interior in convex optimization
• Remarks on infinite dimensional duality
• Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
• 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
• Separation theorem based on the quasirelative interior and application to duality theory
• A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule
• General infinite dimensional duality and applications to evolutionary network equilibrium problems
• Infinite dimensional duality and applications
• Non-Convex Strong Duality Via Subdifferential
• Duality in Vector Optimization
• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
• Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone

This page was built for publication: On the use of the quasi-relative interior in optimization