A family of variable metric proximal methods
From MaRDI portal
Publication:1804367
DOI10.1007/BF01585756zbMath0832.90102MaRDI QIDQ1804367
Joseph Frédéric Bonnans, Gilbert, Jean Charles, Claudia A. Sagastizábal, Claude Lemaréchal
Publication date: 5 March 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
superlinear convergenceMoreau-Yosida regularizationbundle methodvariable metricquasi-Newton approximations of smooth functions
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41)
Related Items
Forward-backward quasi-Newton methods for nonsmooth optimization problems, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, A globally convergent Newton method for convex \(SC^ 1\) minimization problems, Limited-memory BFGS with displacement aggregation, An ODE-like nonmonotone method for nonsmooth convex optimization, On superlinear convergence of quasi-Newton methods for nonsmooth equations, The developments of proximal point algorithms, A bundle modification strategy for convex minimization, Fast Moreau envelope computation I: Numerical algorithms, A quasi-second-order proximal bundle algorithm, On approximations with finite precision in bundle methods for nonsmooth optimization, Nonsmooth optimization via quasi-Newton methods, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Conjugate gradient type methods for the nondifferentiable convex minimization, Optimal Convergence Rates for the Proximal Bundle Method, Scaled proximal gradient methods for sparse optimization problems, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization, Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, Computing proximal points of nonconvex functions, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, The perturbed generalized proximal point algorithm, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs, Essentials of numerical nonsmooth optimization, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, Adaptive FISTA for Nonconvex Optimization, Globally convergent BFGS method for nonsmooth convex optimization, Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization, The indefinite proximal point algorithms for maximal monotone operators, A splitting algorithm for coupled system of primal-dual monotone inclusions, Essentials of numerical nonsmooth optimization, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, Composition duality principles for mixed variational inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Proximity control in bundle methods for convex nondifferentiable minimization
- Local convergence of quasi-Newton methods for B-differentiable equations
- Convergence of some algorithms for convex minimization
- A quasi-second-order proximal bundle algorithm
- A nonsmooth version of Newton's method
- Nonsmooth Equations: Motivation and Algorithms
- Newton's Method for B-Differentiable Equations
- A descent algorithm for nonsmooth convex optimization
- Optimization and nonsmooth analysis
- Orthogonal Projections on Convex Sets for Newton-Like Methods
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Quasi-Newton Methods, Motivation and Theory
- Monotone Operators and the Proximal Point Algorithm
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Numerical methods for nondifferentiable convex optimization
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
