A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
type: Item
instance of: scholarly article
title: A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
zbMATH Open document ID: 1406.49032
DOI: 10.1080/10556788.2017.1378652
author: Nitish Shirish Keskar
author: Andreas Wächter
publication date: 2019-01-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1612.07350
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 49M15
zbMATH DE Number: 7001348
zbMATH Keywords: non-smooth optimization
zbMATH Keywords: bound constraints
zbMATH Keywords: quasi-Newton
zbMATH Keywords: L-BFGS
zbMATH Keywords: active-set method
zbMATH Keywords: active-set correction
describes a project that uses: CVXOPT
describes a project that uses: UFO
describes a project that uses: LBFGS-B
describes a project that uses: GradSamp
describes a project that uses: LDGB
describes a project that uses: L-BFGS
describes a project that uses: Theano
describes a project that uses: NumPy
describes a project that uses: Python
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2562219230
arXiv ID: 1612.07350
cites work: Introduction to Nonsmooth Optimization
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
cites work: Representations of quasi-Newton matrices and their use in limited memory methods
cites work: A family of second-order methods for convex \(\ell _1\)-regularized optimization
cites work: A Limited Memory Algorithm for Bound Constrained Optimization
cites work: Q3996569
cites work: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
cites work: An adaptive gradient sampling algorithm for non-smooth optimization
cites work: A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
cites work: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
cites work: New limited memory bundle method for large-scale nonsmooth optimization
cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization
cites work: A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
cites work: Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
cites work: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
cites work: Comparing different nonsmooth minimization methods and software
cites work: A second-order method for convex1-regularized optimization with active-set prediction
cites work: Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
cites work: Nonsmooth optimization via quasi-Newton methods
cites work: Nonsmoothness and a variable metric method
cites work: On the limited memory BFGS method for large scale optimization
cites work: Survey of Bundle Methods for Nonsmooth Optimization
cites work: Q5491447
published in: Optimization Methods \& Software
description: scientific article; zbMATH DE number 7001348