On the use of the quasi-relative interior in optimization

DOI10.1080/02331934.2015.1032284zbMATH Open1337.49060OpenAlexW2041274954MaRDI QIDQ2808318FDOQ2808318

Authors: Constantin Zălinescu 

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

Recommendations

• Revisiting some duality theorems via the quasirelative interior in convex optimization
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
• Quasi-relative interiors for graphs of convex set-valued mappings
• ON A SEPARATION THEOREM INVOLVING THE QUASI-RELATIVE INTERIOR
• Separation theorem based on the quasirelative interior and application to duality theory

zbMATH Keywords

constrained optimizationdualitysubdifferentialset-valued optimizationLagrange functionquasi-relative interiorscalar optimizationquasi-interior

Mathematics Subject Classification ID

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

Cites Work

• Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
• 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
• Separation theorem based on the quasirelative interior and application to duality theory
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• Remarks on infinite dimensional duality
• Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
• Notions of relative interior in Banach spaces
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
• The infinite dimensional Lagrange multiplier rule for convex optimization problems
• Revisiting some duality theorems via the quasirelative interior in convex optimization
• Infinite dimensional duality and applications
• Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
• General infinite dimensional duality and applications to evolutionary network equilibrium problems
• Non-convex strong duality via subdifferential
• Duality in Vector Optimization
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule

Cited In (18)

• On epsilon-stability in optimization
• Quasi-relative interiors for graphs of convex set-valued mappings
• Title not available (Why is that?)
• Set-valued systems with infinite-dimensional image and applications
• Image convexity of generalized systems with infinite-dimensional image and applications
• Finitely convergent iterative methods with overrelaxations revisited
• On the intrinsic core of convex cones in real linear spaces
• Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
• Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
• Characterizations via linear scalarization of minimal and properly minimal elements
• Face relative interior of convex sets in topological vector spaces
• On the global shape of convex functions on locally convex spaces
• Generalized relative interiors and generalized convexity in infinite-dimensional spaces
• Infinite-dimensional vector optimization and a separation theorem
• Vector optimization w.r.t. relatively solid convex cones in real linear spaces
• On three open problems related to quasi relative interior
• Relationships between polyhedral convex sets and generalized polyhedral convex sets
• The intrinsic core and minimal faces of convex sets in general vector spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808318)