An approximate quasi-Newton bundle-type method for nonsmooth optimization
From MaRDI portal
Publication:370139
DOI10.1155/2013/697474zbMATH Open1278.90315OpenAlexW1995156712WikidataQ58916658 ScholiaQ58916658MaRDI QIDQ370139FDOQ370139
Authors: Jie Shen, Li-Ping Pang, Dan Li 
Publication date: 19 September 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/697474
Recommendations
- A quasi-Newton bundle method based on approximate subgradients
- A bundle-type quasi-Newton method for nonconvex nonsmooth optimization
- A modified BFGS bundle algorithm based on approximate subgradients
- An implementable bundle method for nonsmooth convex optimization
- Convergence analysis of an infeasible quasi-Newton bundle method for nonsmooth convex programming
Cites Work
- A descent algorithm for nonsmooth convex optimization
- Title not available (Why is that?)
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Title not available (Why is that?)
- A proximal bundle method based on approximate subgradients
- On approximations with finite precision in bundle methods for nonsmooth optimization
- A quasi-second-order proximal bundle algorithm
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- The 𝒰-Lagrangian of a convex function
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Globally convergent BFGS method for nonsmooth convex optimization
- Title not available (Why is that?)
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Approximations in proximal bundle methods and decomposition of convex programs
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- An Algorithm for Nonsmooth Convex Minimization With Errors
- Title not available (Why is that?)
- Minimizing and stationary sequences of convex constrained minimization problems
Cited In (12)
- A quasi-Newton bundle method based on approximate subgradients
- Randomized smoothing variance reduction method for large-scale non-smooth convex optimization
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A memory gradient method for non-smooth convex optimization
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- An ODE-like nonmonotone method for nonsmooth convex optimization
- Convergence analysis of an infeasible quasi-Newton bundle method for nonsmooth convex programming
- A hybrid bundle method for nonsmooth convex optimization
- An implementable bundle method for nonsmooth convex optimization
- A bundle-type quasi-Newton method for nonconvex nonsmooth optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
This page was built for publication: An approximate quasi-Newton bundle-type method for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370139)
