Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
From MaRDI portal
Publication:2841063
DOI10.1093/imanum/drs027zbMath1272.65050OpenAlexW1995126983WikidataQ58040543 ScholiaQ58040543MaRDI QIDQ2841063
Rohollah Garmanjani, Luis Nunes Vicente
Publication date: 24 July 2013
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/drs027
algorithmconvergencenumerical experimentsderivative-free optimizationnonconvexityworst-case complexitydirect searchsmoothing functionnonsmoothness
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)
Related Items
A smoothing trust region filter algorithm for nonsmooth least squares problems, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, 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, A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization, Penalty methods with stochastic approximation for stochastic nonlinear programming, Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods, Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials, A note on the smoothing quadratic regularization method for non-Lipschitz optimization, A derivative-free trust-region algorithm for composite nonsmooth optimization, Smoothing methods for nonsmooth, nonconvex minimization, Worst-case complexity bounds of directional direct-search methods for multiobjective optimization, Worst case complexity of direct search under convexity, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, A second-order globally convergent direct-search method and its worst-case complexity, Worst case complexity of direct search, Steklov regularization and trajectory methods for univariate global optimization, Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case, Derivative-free optimization methods
Uses Software
