Numerical methods for nondifferentiable convex optimization
From MaRDI portal
Publication:4726049
DOI10.1007/BFb0121157zbMath0616.90052MaRDI QIDQ4726049
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
cutting plane methodnonsmooth programmingproximal methodnondifferentiable convex programmingunconstrained and the constrained cases
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items
A proximal-based deomposition method for compositions method for convex minimization problems ⋮ Penalty-proximal methods in convex programming ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ A constraint linearization method for nondifferentiable convex minimization ⋮ Variable metric bundle methods: From conceptual to implementable forms ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ An optimal variant of Kelley's cutting-plane method ⋮ A continuation method for monotone variational inequalities ⋮ Generalized proximal point algorithm for convex optimization ⋮ A quasi-second-order proximal bundle algorithm ⋮ Family of perturbation methods for variational inequalities ⋮ Multi-step-prox-regularization method for solving convex variation problems ⋮ Coupling the proximal point algorithm with approximation methods ⋮ Theoretical aspect of diagonal Bregman proximal methods ⋮ A descent method with linear programming subproblems for nondifferentiable convex optimization ⋮ A feasible directions method for nonsmooth convex optimization ⋮ Accelerated differential inclusion for convex optimization ⋮ Convergence rates of accelerated proximal gradient algorithms under independent noise ⋮ Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Inexact version of Bregman proximal gradient algorithm ⋮ Proximity control in bundle methods for convex nondifferentiable minimization ⋮ Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ A successive quadratic programming method for a class of constrained nonsmooth optimization problems ⋮ Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ Computing proximal points of nonconvex functions ⋮ A bundle-filter method for nonsmooth convex constrained optimization ⋮ A decomposition method for convex minimization problems and its application. ⋮ Robustness of the hybrid extragradient proximal-point algorithm. ⋮ Minimizing and stationary sequences of convex constrained minimization problems ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ The perturbed Tikhonov's algorithm and some of its applications ⋮ A family of variable metric proximal methods ⋮ Convergence analysis of some methods for minimizing a nonsmooth convex function ⋮ Prox-regularization and solution of ill-posed elliptic variational inequalities ⋮ Globally convergent BFGS method for nonsmooth convex optimization ⋮ Inexact proximal point algorithms and descent methods in optimization ⋮ A \(\mathcal{VU}\)-algorithm for convex minimization ⋮ About saddle values of a class of convex-concave functions ⋮ A memory gradient method for non-smooth convex optimization ⋮ The perturbed proximal point algorithm and some of its applications ⋮ Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results ⋮ Descent algorithm for a class of convex nondifferentiable functions ⋮ Nonmonotone bundle-type scheme for convex nonsmooth minimization ⋮ Convergence of some algorithms for convex minimization
