Generalized weak sharp minima in cone-constrained convex optimization with applications
From MaRDI portal
Recommendations
- Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds
- Generalized weak sharp minima and the existence of strong Lagrangian multipliers in conic convex optimization
- Necessary conditions for weak sharp minima in cone-constrained optimization problems
- Weak sharp minima revisited. I: Basic theory
- Global weak sharp minima for convex (semi-)infinite optimization problems
Cites work
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 124640 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- A Gauss-Newton method for convex composite optimization
- A simple characterization of solutions sets of convex programs
- A subdifferential condition for calmness of multifunctions
- Characterization of solution sets of convex programs
- Finite termination of the proximal point algorithm
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- Iterative linear programming solution of convex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On Uniqueness of Lagrange Multipliers in Optimization Problems Subject to Cone Constraints
- On convergence of the Gauss-Newton method for convex composite optimization.
- On the Identification of Active Constraints
- Optimal stability and eigenvalue multiplicity
- Optimality Conditions for Irregular Inequality-Constrained Problems
- Optimization and nonsmooth analysis
- Optimizing matrix stability
- Sharp minima for multiobjective optimization in Banach spaces
- Solving cone-constrained convex programs by differential inclusions
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness in sequential linear programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Minima in Multicriteria Linear Programming
- Weak Sharp Solutions of Variational Inequalities
- Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces
- Weak sharp minima for piecewise linear multiobjective optimization in normed spaces
- Weak sharp minima revisited. I: Basic theory
- Weak sharp minima revisited. II: Application to linear regularity and error bounds
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
Cited in
(5)- Necessary conditions for weak sharp minima in cone-constrained optimization problems
- Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Convex minimization problems with weak constraint qualifications
- Generalized weak sharp minima and the existence of strong Lagrangian multipliers in conic convex optimization
This page was built for publication: Generalized weak sharp minima in cone-constrained convex optimization with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935574)
