A regularized semi-smooth Newton method with projection steps for composite convex programs
From MaRDI portal
Publication:1668726
DOI10.1007/s10915-017-0624-3zbMath1394.90534arXiv1603.07870OpenAlexW2963255983MaRDI QIDQ1668726
Xiantao Xiao, Yongfeng Li, ZaiWen Wen, Li-wei Zhang
Publication date: 29 August 2018
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.07870
Related Items
A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization ⋮ An active set Newton-CG method for \(\ell_1\) optimization ⋮ On the application of the SCD semismooth* Newton method to variational inequalities of the second kind ⋮ An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ Newton-type methods with the proximal gradient step for sparse estimation ⋮ A communication-efficient and privacy-aware distributed algorithm for sparse PCA ⋮ Inexact proximal DC Newton-type method for nonconvex composite functions ⋮ Proximal quasi-Newton method for composite optimization over the Stiefel manifold ⋮ An exact penalty approach for optimization with nonnegative orthogonality constraints ⋮ A Riemannian Proximal Newton Method ⋮ An inexact Riemannian proximal gradient method ⋮ An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints ⋮ Unnamed Item ⋮ Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction ⋮ Efficient Numerical Methods for Computing the Stationary States of Phase Field Crystal Models ⋮ Anderson Accelerated Douglas--Rachford Splitting ⋮ Mini-workshop: Computational optimization on manifolds. Abstracts from the mini-workshop held November 15--21, 2020 (online meeting) ⋮ Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold ⋮ Search Direction Correction with Normalized Gradient Makes First-Order Methods Faster ⋮ Virtual element methods for elliptic variational inequalities of the second kind ⋮ A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs ⋮ A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization ⋮ On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization ⋮ Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution ⋮ A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration ⋮ An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- A coordinate gradient descent method for nonsmooth separable minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Directionally nondifferentiable metric projection
- A semismooth equation approach to the solution of nonlinear complementarity problems
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Some recent advances in projection-type methods for variational inequalities
- Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities
- A nonsmooth version of Newton's method
- Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
- Introduction to Piecewise Differentiable Equations
- Proximal Splitting Methods in Signal Processing
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A class of derivative-free methods for large-scale nonlinear monotone equations
- Nonsmooth Equations: Motivation and Algorithms
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Semismooth and Semiconvex Functions in Constrained Optimization
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
- Variational Analysis
- Sparse Reconstruction by Separable Approximation
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- Convergence Rate Analysis of Several Splitting Schemes
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- Semismooth Matrix-Valued Functions
- Convex analysis and monotone operator theory in Hilbert spaces
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
