Generalized weak sharp minima in cone-constrained convex optimization with applications
type: Item
instance of: scholarly article
title: Generalized weak sharp minima in cone-constrained convex optimization with applications
zbMATH Open document ID: 1285.90035
author: Yanyan Li
published in: Computational Optimization and Applications
publication date: 2013-02-18T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 6137010
zbMATH Keywords: cone-constrained convex programming
zbMATH Keywords: generalized weak sharp minima
zbMATH Keywords: Robinson's constraint qualification
zbMATH Keywords: systems of differential inclusions
zbMATH Keywords: tangent cone
MaRDI profile type: Publication
full work available at URL: s10589-012-9457-z
OpenAlex ID: W2087945979
cites work: Q3324260
cites work: Characterization of solution sets of convex programs
cites work: Weak Sharp Minima in Mathematical Programming
cites work: A Gauss-Newton method for convex composite optimization
cites work: Q5478968
cites work: Weak sharp minima revisited. II: Application to linear regularity and error bounds
cites work: Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
cites work: Optimizing matrix stability
cites work: Optimal stability and eigenvalue multiplicity
cites work: On the Identification of Active Constraints
cites work: Optimization and nonsmooth analysis
cites work: Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
cites work: Weak Sharp Minima in Multicriteria Linear Programming
cites work: Iterative linear programming solution of convex programs
cites work: Finite termination of the proximal point algorithm
cites work: Solving cone-constrained convex programs by differential inclusions
cites work: Q4026289
cites work: A subdifferential condition for calmness of multifunctions
cites work: Optimality Conditions for Irregular Inequality-Constrained Problems
cites work: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
cites work: Strong uniqueness and second order convergence in nonlinear discrete approximation
cites work: Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
cites work: Q4257334
cites work: On convergence of the Gauss-Newton method for convex composite optimization.
cites work: A simple characterization of solutions sets of convex programs
cites work: Weak Sharp Solutions of Variational Inequalities
cites work: Strong uniqueness in sequential linear programming
cites work: On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
cites work: Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
cites work: Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces
cites work: Strong KKT conditions and weak sharp solutions in convex-composite optimization
cites work: Sharp minima for multiobjective optimization in Banach spaces
cites work: Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
cites work: Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
DOI: 10.1007/S10589-012-9457-Z
description: scientific article; zbMATH DE number 6137010