Active‐Set Newton Methods and Partial Smoothness

DOI10.1287/moor.2020.1075zbMath1471.90143arXiv1902.00724MaRDI QIDQ5000651

Calvin J. S. Wylie, Adrian S. Lewis

Publication date: 15 July 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.00724

zbMATH Keywords

variational inequality; active set identification; partial smoothness

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

49M05: Numerical methods based on necessary conditions

90C31: Sensitivity, stability, parametric optimization

Related Items

Partial Smoothness and Constant Rank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proximal method for composite minimization
• Optimality, identifiability, and sensitivity
• Finite convergence of algorithms for nonlinear programs and variational inequalities
• Computing proximal points of nonconvex functions
• Finite termination of the proximal point algorithm
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Nonsmooth equations in optimization. Regularity, calculus, methods and applications
• On finite convergence and constraint identification of subgradient projection methods
• On the convergence of projected gradient processes to singular critical points
• Newton-type methods: a broader view
• The degrees of freedom of partly smooth regularizers
• A \(\mathcal{VU}\)-algorithm for convex minimization
• Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
• Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
• Identifiable Surfaces in Constrained Optimization
• Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness
• 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
• On the Accurate Identification of Active Constraints
• 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
• Sensitivity Analysis for Mirror-Stratifiable Convex Functions
• Model Consistency of Partly Smooth Regularizers
• 𝒱𝒰-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
• Partial Smoothness, Tilt Stability, and Generalized Hessians
• Newton-Type Methods for Optimization and Variational Problems
• Local linear convergence analysis of Primal–Dual splitting methods