The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces

DOI10.1137/20M1324259OpenAlexW3162554068MaRDI QIDQ4989940

Xiaopeng Zhao, Chong Li, Ng Kung-fu, Jen-Chih Yao

Publication date: 27 May 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1324259

zbMATH Keywords

Slater conditioninterior-point conditionbasic constraint qualificationconvex inequality systemFM qualification

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Approximation with constraints (41A29) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)

Related Items (1)

Duality for sets of strong Slater points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
• Local and global optimality conditions for dc infinite optimization problems
• On set containment characterization and constraint qualification for quasiconvex programming
• Fenchel duality in infinite-dimensional setting and its applications.
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• A unifying approach to robust convex infinite optimization duality
• A method for convex minimization based on translated first-order approximations
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Fenchel duality and the strong conical hull intersection property
• Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems
• Strong Abadie CQ, ACQ, calmness and linear regularity
• Optimality conditions in convex multiobjective SIP
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• The strong conical hull intersection property for convex programming
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• Extension of Fenchel's duality theorem for convex functions
• Weaker conditions for subdifferential calculus of convex functions
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Subdifferentials of Marginal Functions in Semi-infinite Programming
• Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Optimization and nonsmooth analysis
• Variational Analysis
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
• Variational Analysis and Applications
• Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
• On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
• Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
• Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets
• On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
• Characterizations of the Strong Basic Constraint Qualifications
• Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
• New Farkas-type constraint qualifications in convex infinite programming
• Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces
• Strong CHIP, normality, and linear regularity of convex sets
• Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Convex Analysis
• Set-valued analysis

This page was built for publication: The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces