A trust region algorithm for minimization of locally Lipschitzian functions
From MaRDI portal
Publication:1338134
DOI10.1007/BF01581136zbMath0821.90108MaRDI QIDQ1338134
Publication date: 27 September 1995
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global convergence; trust region algorithm; minimization of locally Lipschitzian functions; nonsmooth case
Related Items
A new trust region method for nonsmooth equations, A globally and superlinearly convergent trust region method for \(LC^1\) optimization problems, Canonical duality for solving nonconvex and nonsmooth optimization problem, A new filter method for solving nonlinear complementarity problems, A trust region method for minimization of nonsmooth functions with linear constraints, On piecewise quadratic Newton and trust region problems, Iteration functions in some nonsmooth optimization algorithms, Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions, Nonmonotone trust region method for solving optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- On the global convergence of trust region algorithms for unconstrained minimization
- Local properties of algorithms for minimizing nonsmooth composite functions
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Descent methods for composite nondifferentiable optimization problems
- An Improved Successive Linear Programming Algorithm
- The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Submonotone Subdifferentials of Lipschitz Functions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Minimization of Locally Lipschitzian Functions
- Linear-Quadratic Programming and Optimal Control
- Iteration Functions in Some Nonsmooth Optimization Algorithms