Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
From MaRDI portal
Publication:2425996
DOI10.1016/j.amc.2007.08.044zbMath1137.65043OpenAlexW2044941703WikidataQ57932044 ScholiaQ57932044MaRDI QIDQ2425996
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
constrained optimizationnumerical experimentsnonconvexnonsmoothlarge-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)
Related Items
Comparing different nonsmooth minimization methods and software ⋮ A conjugate gradient sampling method for nonsmooth optimization ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of upper semidifferentiable functions
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Some numerical experiments with variable-storage quasi-Newton algorithms
- A constraint linearization method for nondifferentiable convex minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Feasible direction interior-point technique for nonlinear optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Updating Quasi-Newton Matrices with Limited Storage
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- New limited memory bundle method for large-scale nonsmooth optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
