Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
From MaRDI portal
Recommendations
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
- Smoothing approximations to nonsmooth optimization problems
- A direct search method for smooth and nonsmooth unconstrained optimization
- Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
- On the possibility of applying smooth methods to the solution of non- smooth optimization problems
- Using simplex gradients of nonsmooth functions in direct search methods
- On a new smoothing technique for non-smooth, non-convex optimization
- Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
- Smoothing methods for nonsmooth, nonconvex minimization
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Cited in
(28)- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- Steklov regularization and trajectory methods for univariate global optimization
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- A direct search method for smooth and nonsmooth unconstrained optimization
- A second-order globally convergent direct-search method and its worst-case complexity
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- A smoothing trust region filter algorithm for nonsmooth least squares problems
- Penalty methods with stochastic approximation for stochastic nonlinear programming
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization
- A derivative-free comirror algorithm for convex optimization
- Using simplex gradients of nonsmooth functions in direct search methods
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- Derivative-free optimization methods
- Worst case complexity of direct search under convexity
- Worst case complexity bounds for linesearch-type derivative-free algorithms
- Stochastic zeroth order descent with structured directions
- Neural network-based parameter estimation for nonautonomous differential equations with discontinuous signals
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- Smoothing methods for nonsmooth, nonconvex minimization
- The gradient's limit of a definable family of functions admits a variational stratification
- Worst case complexity of direct search
This page was built for publication: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841063)
