Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization

From MaRDI portal
Revision as of 19:20, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (20)

A smoothing trust region filter algorithm for nonsmooth least squares problemsSmoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimizationA smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedronA Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth OptimizationA derivative-free comirror algorithm for convex optimizationA note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimizationPenalty methods with stochastic approximation for stochastic nonlinear programmingDerivative-Free Optimization of Noisy Functions via Quasi-Newton MethodsSteklov convexification and a trajectory method for global optimization of multivariate quartic polynomialsA note on the smoothing quadratic regularization method for non-Lipschitz optimizationA derivative-free trust-region algorithm for composite nonsmooth optimizationSmoothing methods for nonsmooth, nonconvex minimizationWorst-case complexity bounds of directional direct-search methods for multiobjective optimizationWorst case complexity of direct search under convexityComplexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimizationA second-order globally convergent direct-search method and its worst-case complexityWorst case complexity of direct searchSteklov regularization and trajectory methods for univariate global optimizationTrust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth CaseDerivative-free optimization methods


Uses Software






This page was built for publication: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization