Generalizations of Slater's constraint qualification for infinite convex programs
From MaRDI portal
Publication:1198330
DOI10.1007/BF01581074zbMath0771.90078OpenAlexW2045632163MaRDI QIDQ1198330
Henry Wolkowicz, Vaithilingam Jeyakumar
Publication date: 16 January 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581074
constraint qualificationsduality resultslocal compactnessSlater's constraint qualificationweaker quasi-relative interior constraint qualification
Related Items (49)
New qualification conditions for convex optimization without convex representation ⋮ On optimality conditions for quasi-relative efficient solutions in set-valued optimization ⋮ Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems ⋮ Gradient methods and conic least-squares problems ⋮ Liberating the subgradient optimality conditions from constraint qualifications ⋮ Robust linear semi-infinite programming duality under uncertainty ⋮ Generalized convex relations with applications to optimization and models of economic dynamics ⋮ Integral comparisons of nonnegative positive definite functions on LCA groups ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation ⋮ Continuous-time inverse quadratic optimal control problem ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Approximate solution in robust multi-objective optimization and its application in portfolio optimization ⋮ Addendum to: Entropic value-at-risk: a new coherent risk measure ⋮ Necessary conditions for efficient solution of vector optimization problems ⋮ APPLICATIONS OF AN INTERSECTION FORMULA TO DUAL CONES ⋮ Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior ⋮ A metric approach to asymptotic analysis. ⋮ Constraint qualifications characterizing Lagrangian duality in convex optimization ⋮ Fenchel duality in infinite-dimensional setting and its applications. ⋮ Characterizing best approximation from a convex set without convex representation ⋮ Duality theory and applications to unilateral problems ⋮ A Variational Approach to the Financial Problem with Insolvencies and Analysis of the Contagion ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ Revisiting some duality theorems via the quasirelative interior in convex optimization ⋮ A simple closure condition for the normal cone intersection formula ⋮ Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems ⋮ Strong duality in robust semi-definite linear programming under data uncertainty ⋮ Remarks on infinite dimensional duality ⋮ The strong conical hull intersection property for convex programming ⋮ A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ An alternative formulation for a new closed cone constraint qualification ⋮ Necessary and sufficient conditions for stable conjugate duality ⋮ Robust constrained best approximation with nonconvex constraints ⋮ Sequential Lagrangian conditions for convex programs with applications to semidefinite programming ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints ⋮ Convergence of truncates in l 1 optimal feedback control 61 ⋮ A new geometric condition for Fenchel's duality in infinite dimensional spaces ⋮ Constraint qualifications in nonsmooth multiobjective optimization ⋮ Infinite-dimensional convex programming with applications to constrained approximation ⋮ Optimality conditions for vector optimization problems of a difference of convex mappings ⋮ Strong duality for robust minimax fractional programming problems
Cites Work
- Constrained \(L_ p\) approximation
- A note on convex cones and constraint qualifications in infinite- dimensional vector spaces
- Some applications of optimization in matrix theory
- A strengthened test for optimality
- Partially finite convex programming. II: Explicit lattice models
- Zero duality gaps in infinite-dimensional programming
- Constrained best approximation in Hilbert space
- Optimization and nonsmooth analysis
- A simple constraint qualification in infinite dimensional programming
- The Slater Condition in Infinite-Dimensional Vector Spaces
- Characterizations of optimality without constraint qualification for the abstract convex program
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalizations of Slater's constraint qualification for infinite convex programs
