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

By Rohollah Garmanjani, Luís Nunes Vicente. 2013

54 citations recorded by the source corpus.

Subfields: Computational Mechanics, Numerical Analysis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

1. Xiaojun Chen
2. Luís Nunes Vicente
3. Rohollah Garmanjani

In Numerical Analysis

1. Xiaojun Chen
2. Luís Nunes Vicente
3. Rohollah Garmanjani

Citations in the corpus

• Worst case complexity of direct search (2013, background): “Deviation from smoothness (see [2, 18]) poses several difficulties to the derivation of a worst case complexity bound, and such a study will be the subject of a separate paper [9].”
• Smoothing methods for nonsmooth, nonconvex minimization (2012, methodology): “Recently, Garmanjani and Vicente [50] propose a smoothing direct search (DS) algorithm basing on smooth approximations and derivative free methods for nonsmooth, nonconvex, Lipschitz continuous unconstrained minimization problems.”