A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
From MaRDI portal
Publication:4717559
DOI10.1137/S1052623494278839zbMath0868.90109OpenAlexW2040017185MaRDI QIDQ4717559
Publication date: 1 December 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494278839
semismoothnessMoreau-Yosida regularizationnondifferentiable convex minimization\(Q\)-superlinear rate of convergence
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, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems, A Method for Minimization of Quasidifferentiable Functions, Variable metric bundle methods: From conceptual to implementable forms, A preconditioning proximal Newton method for nondifferentiable convex optimization, A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications, 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, The developments of proximal point algorithms, Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model, A bundle modification strategy for convex minimization, Multivariate spectral gradient algorithm for nonsmooth convex optimization problems, A remark on recent results for finding zeroes of accretive operators, A quasi-Newton bundle method based on approximate subgradients, An approximate quasi-Newton bundle-type method for nonsmooth optimization, A stochastic model for risk management in global supply chain networks, Regularization in Banach spaces with respect to the Bregman distance, Two parallel distribution algorithms for convex constrained minimization problems, An efficient conjugate gradient method with strong convergence properties for non-smooth optimization, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Conjugate gradient type methods for the nondifferentiable convex minimization, A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems, Proximal quasi-Newton method for composite optimization over the Stiefel manifold, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, A modified conjugate gradient method for general convex functions, A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization, First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing, On the semismoothness of projection mappings and maximum eigenvalue functions, Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, Some new step-size rules for optimization problems, On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs, A new trust region algorithm for nonsmooth convex minimization, Minimizing and stationary sequences of convex constrained minimization problems, An effective adaptive trust region algorithm for nonsmooth minimization, Essentials of numerical nonsmooth optimization, Convergence analysis of some methods for minimizing a nonsmooth convex function, 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, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization, Globally convergent BFGS method for nonsmooth convex optimization, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization, A \(\mathcal{VU}\)-algorithm for convex minimization, Essentials of numerical nonsmooth optimization, A memory gradient method for non-smooth convex optimization, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
