A quasi-second-order proximal bundle algorithm
type: Item
instance of: scholarly article
title: A quasi-second-order proximal bundle algorithm
zbMATH Open document ID: 0848.90100
DOI: 10.1007/BF02592098
author: Robert Mifflin
published in: Mathematical Programming. Series A. Series B
publication date: 1996-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 894756
zbMATH Keywords: bundle methods
zbMATH Keywords: convex minimization
zbMATH Keywords: global convergence
zbMATH Keywords: variable metric algorithms
zbMATH Keywords: quasi-Newton updates
zbMATH Keywords: proximal point algorithm
MaRDI profile type: Publication
cites work: Variational quasi-Newton methods for unconstrained optimization
cites work: Numerical methods for nondifferentiable convex optimization
cites work: A family of variable metric proximal methods
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: Convergence of quasi-Newton matrices generated by the symmetric rank one update
cites work: Convergence of some algorithms for convex minimization
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: Resolving degeneracy in quadratic programming
cites work: A descent algorithm for nonsmooth convex optimization
cites work: Q4739659
cites work: Q4273942
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: A Theoretical and Experimental Study of the Symmetric Rank-One Update
cites work: Methods of descent for nondifferentiable optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian
cites work: Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
cites work: Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
cites work: Q3340505
cites work: On superlinear convergence in univariate nonsmooth minimization
cites work: The least prior deviation quasi-Newton update
cites work: A nonsmooth version of Newton's method
cites work: Convex Analysis
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: Applications of the method of partial inverses to convex programming: Decomposition
cites work: Q4146571
cites work: Functional Analysis
cites work: Q3703599
description: scientific article; zbMATH DE number 894756