Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
From MaRDI portal
Publication:1036159
DOI10.1016/j.jmaa.2009.09.006zbMath1175.49031MaRDI QIDQ1036159
Publication date: 5 November 2009
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.09.006
convex optimization; regularity conditions; Lagrange duality; quasi-relative interior; quasi-interior
90C25: Convex programming
49N60: Regularity of solutions in optimal control
49N15: Duality theory (optimization)
Related Items
On the Intrinsic Core of Convex Cones in Real Linear Spaces, Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors, Higher-order optimality conditions for set-valued optimization with ordering cones having empty interior using variational sets, Image convexity of generalized systems with infinite-dimensional image and applications, Motzkin's theorem of the alternative: a continuous-time generalization, Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria, Duality theory and applications to unilateral problems, Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior, On epsilon-stability in optimization, Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap, Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set, Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior, Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems, On the use of the quasi-relative interior in optimization, The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- 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
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- On general infinite dimensional complementarity problems
- Infinite dimensional duality and applications
- Lagrange multipliers and infinite-dimensional equilibrium problems
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- An alternative formulation for a new closed cone constraint qualification
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
