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

ISSN： 1464-3642

Source： IMA Journal of Numerical Analysis, Vol.33, Iss.3, 2013-07, pp. : 1008-1028

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

Optimization, Vol. 64, Iss. 5, 2015-05 ,pp. : 1349-1361

Taylor & Francis Ltd

Access to resources Recommend Favorite

Worst-Case Fault Detection Observer Design: Optimization Approach

By Wang H. Wang J. Lam J.

Journal of Optimization Theory and Applications, Vol. 132, Iss. 3, 2007-03 ,pp. : 475-491

Springer Publishing Company

Access to resources Recommend Favorite

Survey of Bundle Methods for Nonsmooth Optimization

By Mäkelä Marko

Optimization Methods and Software, Vol. 17, Iss. 1, 2002-01 ,pp. : 1-29

Taylor & Francis Ltd

Access to resources Recommend Favorite

Worst-case CVaR based portfolio optimization models with applications to scenario planning

By Tong Xiaojiao Wu Felix Qi Liqun

Optimization Methods and Software, Vol. 24, Iss. 6, 2009-12 ,pp. : 933-958

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Worst-Case GMRES for Normal Matrices

By Liesen Jörg

Bit Numerical Mathematics, Vol. 44, Iss. 1, 2004-01 ,pp. : 79-98

Springer Publishing Company

Access to resources Recommend Favorite