Strong KKT conditions and weak sharp solutions in convex-composite optimization

DOI10.1007/s10107-009-0277-6zbMath1229.90147OpenAlexW2112045043MaRDI QIDQ623359

Xi Yin Zheng, Ng Kung-fu

Publication date: 14 February 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0277-6

zbMATH Keywords

variational analysismetric regularityconvex-composite optimizationseak sharp solutionssharp solutionsstrong KKT conditions

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items

Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Strong Fermat rules for constrained set-valued optimization problems on Banach spaces ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem ⋮ Necessary conditions for weak sharp minima in cone-constrained optimization problems ⋮ Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ A SUFFICIENT MINIMALITY CONDITION FOR CONVEX COMPOSITE FUNCTIONS ⋮ Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty ⋮ Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets ⋮ Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• Optimality conditions in mathematical programming and composite optimization
• Convex composite non-Lipschitz programming
• Weak Sharp Minima in Mathematical Programming
• Lagrange Multipliers and Optimality
• Metric Subregularity and Constraint Qualifications for Convex Generalized Equations in Banach Spaces
• Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
• Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
• Local properties of algorithms for minimizing nonsmooth composite functions
• Optimization and nonsmooth analysis
• First- and Second-Order Epi-Differentiability in Nonlinear Programming
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
• Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
• Metric regularity and subdifferential calculus
• Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
• Weak Sharp Minima: Characterizations and Sufficient Conditions
• Characterizations of the Strong Basic Constraint Qualifications
• Characterizations of Local and Global Error Bounds for Convex Inequalities in Banach Spaces
• Characterizations of error bounds for lower semicontinuous functions on metric spaces
• On convergence of the Gauss-Newton method for convex composite optimization.