An extension of the quasi-Newton method for minimizing locally Lipschitz functions
From MaRDI portal
Publication:3389584
Recommendations
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- Minimization of Locally Lipschitzian Functions
- An algorithm for minimizing a class of locally Lipschitz functions
- scientific article; zbMATH DE number 940912
Cites work
- A bundle-Newton method for nonsmooth unconstrained minimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- A trust region method for solving linearly constrained locally Lipschitz optimization problems
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Benchmarking optimization software with performance profiles.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Continuous subdifferential approximations and their applications
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Generalized Bundle Methods
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Numerical Optimization
- Survey of Bundle Methods for Nonsmooth Optimization
Cited in
(6)- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Minimal weak upper gradients in Newtonian spaces based on quasi-Banach function lattices
- Quasi-Newton minimization for the p(x)-Laplacian problem
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- An SQP method for minimization of locally Lipschitz functions with nonlinear constraints
- A new nonsmooth trust-region method equipped with a line search for minimizing locally Lipschitz functions
This page was built for publication: An extension of the quasi-Newton method for minimizing locally Lipschitz functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389584)
