A direct search quasi-Newton method for nonsmooth unconstrained optimization
From MaRDI portal
Publication:4608945
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
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 721770 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Simplex Method for Function Minimization
- A direct search method for smooth and nonsmooth unconstrained optimization
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
- A progressive barrier for derivative-free nonlinear programming
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Analysis of Generalized Pattern Searches
- Analysis of direct searches for discontinuous functions
- CARTopt: a random search method for nonsmooth unconstrained optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Frame based methods for unconstrained optimization
- Frame-based ray search algorithms in unconstrained optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- On Accelerated Random Search
- On the Convergence of Pattern Search Algorithms
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Testing Unconstrained Optimization Software
- Theory of Positive Linear Dependence
- Using simplex gradients of nonsmooth functions in direct search methods
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(13)- A direct search method for smooth and nonsmooth unconstrained optimization
- Nonsmooth optimization via quasi-Newton methods
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
- Using simplex gradients of nonsmooth functions in direct search methods
- CARTopt: a random search method for nonsmooth unconstrained optimization
- A quasi-Newton method for unconstrained non-smooth problems
- A Hooke and Jeeves -- CARTopt hybrid method for nonsmooth optimization
- A direct search method for unconstrained quantile-based simulation optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- scientific article; zbMATH DE number 6961995 (Why is no real title available?)
- A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization
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)
