A direct search quasi-Newton method for nonsmooth unconstrained optimization
DOI10.1017/S1446181117000323zbMATH Open1385.65042OpenAlexW4238607192MaRDI QIDQ4608945FDOQ4608945
Publication date: 29 March 2018
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446181117000323
Recommendations
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A direct search method for smooth and nonsmooth unconstrained optimization
- Nonsmooth optimization via quasi-Newton methods
- A direct search conjugate directions algorithm for unconstrained minimization
- A quasi-Newton method for unconstrained non-smooth problems
convergencenonconvexnumerical resultderivative freeClarke generalized derivativedirect search quasi-Newton method
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)
Cites Work
- Testing Unconstrained Optimization Software
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- `` Direct Search Solution of Numerical and Statistical Problems
- A Simplex Method for Function Minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- On the Convergence of Pattern Search Algorithms
- Survey of Bundle Methods for Nonsmooth Optimization
- Theory of Positive Linear Dependence
- CARTopt: a random search method for nonsmooth unconstrained optimization
- On Accelerated Random Search
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- A direct search method for smooth and nonsmooth unconstrained optimization
- Using simplex gradients of nonsmooth functions in direct search methods
- Analysis of direct searches for discontinuous functions
- Analysis of Generalized Pattern Searches
- Title not available (Why is that?)
- Frame based methods for unconstrained optimization
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Frame-based ray search algorithms in unconstrained optimization
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
Cited In (4)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- A direct search method for unconstrained quantile-based simulation optimization
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- Title not available (Why is that?)
Uses Software
This page was built for publication: A direct search quasi-Newton method for nonsmooth unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608945)
