Partial Smoothness and Constant Rank
From MaRDI portal
Publication:5067431
DOI10.1137/19M1237909zbMath1490.90285OpenAlexW2839277202MaRDI QIDQ5067431
Tonghua Tian, Jingwei Liang, Adrian S. Lewis
Publication date: 1 April 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1237909
nonsmooth optimizationsubdifferentialactive set identificationsemi-algebraicprimal-dual splittingpartial smoothness
Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Sensitivity, stability, parametric optimization (90C31)
Related Items
Newton acceleration on manifolds identified by proximal gradient methods, Faster first-order primal-dual methods for linear programming using restarts and sharpness
Cites Work
- Unnamed Item
- Unnamed Item
- Semi-algebraic functions have small subdifferentials
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Optimality, identifiability, and sensitivity
- The dimension of semialgebraic subdifferential graphs
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Computing proximal points of nonconvex functions
- Finite termination of the proximal point algorithm
- Genericity and Hölder stability in semi-algebraic variational inequalities
- On finite convergence and constraint identification of subgradient projection methods
- On the convergence of projected gradient processes to singular critical points
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A Sard theorem for tame set-valued mappings
- Generic Minimizing Behavior in Semialgebraic Optimization
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- Identifiable Surfaces in Constrained Optimization
- On the Identification of Active Constraints II: The Nonconvex Case
- Implicit Functions and Solution Mappings
- Projected gradient methods for linearly constrained problems
- On the Identification of Active Constraints
- Semi-Algebraic Local-Triviality in Semi-Algebraic Mappings
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Variational Analysis
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- The 𝒰-Lagrangian of a convex function
- Active Sets, Nonsmoothness, and Sensitivity
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Active‐Set Newton Methods and Partial Smoothness
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- Local linear convergence analysis of Primal–Dual splitting methods
