Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
DOI10.1016/J.AMC.2007.08.044zbMATH Open1137.65043OpenAlexW2044941703WikidataQ57932044 ScholiaQ57932044MaRDI QIDQ2425996FDOQ2425996
Authors: Yanyan Li 
Publication date: 17 April 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.08.044
Recommendations
- New limited memory bundle method for large-scale nonsmooth optimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- scientific article; zbMATH DE number 16626
nonconvexconstrained optimizationnumerical experimentsnonsmoothlarge-scale problemsfeasible direction interior point methodsnondifferentiable programminglimited memory methodsvariable metric bundle method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Cites Work
- New limited memory bundle method for large-scale nonsmooth optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Title not available (Why is that?)
- Representations of quasi-Newton matrices and their use in limited memory methods
- Methods of descent for nondifferentiable optimization
- Title not available (Why is that?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- New variants of bundle methods
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Feasible direction interior-point technique for nonlinear optimization
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Title not available (Why is that?)
- Optimization of upper semidifferentiable functions
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A constraint linearization method for nondifferentiable convex minimization
Cited In (11)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- New limited memory bundle method for large-scale nonsmooth optimization
- Comparing different nonsmooth minimization methods and software
- Diagonal bundle method for nonsmooth sparse optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- A conjugate gradient sampling method for nonsmooth optimization
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- An adaptive competitive penalty method for nonsmooth constrained optimization
Uses Software
This page was built for publication: Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425996)
