Characterizations of strong variational sufficiency in general models of composite optimization
From MaRDI portal
Cites work
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
- Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
- Convex Analysis
- Expressions for the Moore-Penrose inverse of block matrices involving the Schur complement
- Fixed point and Bregman iterative methods for matrix rank minimization
- Generalized differential calculus for nonsmooth and set-valued mappings
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- On second-order variational analysis of variational convexity of prox-regular functions
- On the Continuity of the Generalized Inverse
- Parabolic regularity in geometric variational analysis
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Second-order variational analysis in optimization, variational stability, and control. Theory, algorithms, applications
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Twice epi-differentiability of extended-real-valued functions with applications in composite optimization
- Variational Analysis
- Variational analysis and applications
- Variational analysis of composite models with applications to continuous optimization
- Variational convexity and the local monotonicity of subgradient mappings
- Variational Convexity of Functions and Variational Sufficiency in Optimization
This page was built for publication: Characterizations of strong variational sufficiency in general models of composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237536)