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

Cites Work

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

Cited In (14)

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

This page was built for publication: Strong KKT conditions and weak sharp solutions in convex-composite optimization

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