Generalized weak sharp minima in cone-constrained convex optimization with applications
From MaRDI portal
Publication:1935574
DOI10.1007/s10589-012-9457-zzbMath1285.90035MaRDI QIDQ1935574
Publication date: 18 February 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9457-z
tangent cone; generalized weak sharp minima; Robinson's constraint qualification; systems of differential inclusions; cone-constrained convex programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Sharp minima for multiobjective optimization in Banach spaces
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
- A simple characterization of solutions sets of convex programs
- Iterative linear programming solution of convex programs
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Finite termination of the proximal point algorithm
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Solving cone-constrained convex programs by differential inclusions
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- A Gauss-Newton method for convex composite optimization
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Characterization of solution sets of convex programs
- Optimizing matrix stability
- Weak Sharp Minima in Mathematical Programming
- Strong uniqueness in sequential linear programming
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- On the Identification of Active Constraints
- Weak Sharp Solutions of Variational Inequalities
- On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
- Optimality Conditions for Irregular Inequality-Constrained Problems
- Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- Weak Sharp Minima in Multicriteria Linear Programming
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- A subdifferential condition for calmness of multifunctions
- Optimal stability and eigenvalue multiplicity
- On convergence of the Gauss-Newton method for convex composite optimization.
