Proximal quasi-Newton methods for nondifferentiable convex optimization
From MaRDI portal
Publication:1300271
DOI10.1007/s101070050059zbMath0946.90111OpenAlexW2075146859MaRDI QIDQ1300271
Publication date: 25 October 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050059
quasi-Newton methodbundle methodsproximal pointcutting-plane methodnondifferentiable convex optimization
Related Items
Forward-backward quasi-Newton methods for nonsmooth optimization problems, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Survey of Bundle Methods for Nonsmooth Optimization, An ODE-like nonmonotone method for nonsmooth convex optimization, On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations, On superlinear convergence of quasi-Newton methods for nonsmooth equations, The developments of proximal point algorithms, A bundle modification strategy for convex minimization, On approximations with finite precision in bundle methods for nonsmooth optimization, A quasi-Newton bundle method based on approximate subgradients, A conjugate gradient sampling method for nonsmooth optimization, A method for convex minimization based on translated first-order approximations, An efficient conjugate gradient method with strong convergence properties for non-smooth optimization, A \(J\)-symmetric quasi-Newton method for minimax problems, Conjugate gradient type methods for the nondifferentiable convex minimization, A globally convergent proximal Newton-type method in nonsmooth convex optimization, A modified conjugate gradient method for general convex functions, 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, Regularizations for stochastic linear variational inequalities, Comparison of two proximal point algorithms for monotone variational inequalities, Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., An adaptive competitive penalty method for nonsmooth constrained optimization, An approximate proximal-extragradient type method for monotone variational inequalities, Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs, Essentials of numerical nonsmooth optimization, On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind, A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem, An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration, Globally convergent BFGS method for nonsmooth convex optimization, Variable metric forward–backward splitting with applications to monotone inclusions in duality, The indefinite proximal point algorithms for maximal monotone operators, A \(\mathcal{VU}\)-algorithm for convex minimization, Essentials of numerical nonsmooth optimization, A memory gradient method for non-smooth convex optimization
