A Trust-region Method for Nonsmooth Nonconvex Optimization
From MaRDI portal
Publication:5881403
DOI10.4208/jcm.2110-m2020-0317OpenAlexW4320516513MaRDI QIDQ5881403
Ziang Chen, ZaiWen Wen, Andre Milzarek
Publication date: 10 March 2023
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.08513
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
Proximal gradient algorithm with trust region scheme on Riemannian manifold ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Gradient methods for minimizing composite functions
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- A trust region algorithm for minimization of locally Lipschitzian functions
- A trust region algorithm for nonsmooth optimization
- Trust region algorithm for nonsmooth optimization
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A trust region method for nonsmooth convex optimization
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- New variants of bundle methods
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- A Riemannian symmetric rank-one trust-region method
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Recent advances in trust region algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Trust-region methods on Riemannian manifolds
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Exact matrix completion via convex optimization
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- Comparing different nonsmooth minimization methods and software
- Optimization with Sparsity-Inducing Penalties
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
- A Singular Value Thresholding Algorithm for Matrix Completion
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Identifiable Surfaces in Constrained Optimization
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- On the Identification of Active Constraints II: The Nonconvex Case
- An implicit trust-region method on Riemannian manifolds
- An Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem
- The Group Lasso for Logistic Regression
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- On the Identification of Active Constraints
- An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions
- A generalized proximal point algorithm for certain non-convex minimization problems
- A model algorithm for composite nondifferentiable optimization problems
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Normal Maps Induced by Linear Transformations
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- Active Sets, Nonsmoothness, and Sensitivity
- Survey of Bundle Methods for Nonsmooth Optimization
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities
- A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
- Sparse solutions to linear inverse problems with multiple measurement vectors
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Model Selection and Estimation in Regression with Grouped Variables
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
