Local Feasible QP-Free Algorithms for the Constrained Minimization of SC¹ Functions

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.119, Iss.2, 2003-11, pp. : 281-316

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

Globally and Superlinearly Convergent QP-Free Algorithm for Nonlinear Constrained Optimization

By Qi L. Yang Y.F.

Journal of Optimization Theory and Applications, Vol. 113, Iss. 2, 2002-05 ,pp. : 297-323

Springer Publishing Company

Access to resources Recommend Favorite

Global Minimization Algorithms for Holder Functions

By Lera D.

Bit Numerical Mathematics, Vol. 42, Iss. 1, 2002-01 ,pp. : 119-133

Springer Publishing Company

Access to resources Recommend Favorite

Two effective hybrid metaheuristic algorithms for minimization of multimodal functions

By Babaie-Kafaki Saman

International Journal of Computer Mathematics, Vol. 88, Iss. 11, 2011-07 ,pp. : 2415-2428

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Inexact SQP Newton Method for Convex SC¹ Minimization Problems

By Chen Y. Gao Y. Liu Y.-J.

Journal of Optimization Theory and Applications, Vol. 146, Iss. 1, 2010-07 ,pp. : 33-49

Springer Publishing Company

Access to resources Recommend Favorite

On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

By García-Palomares Ubaldo M. García-Urrea Ildemaro J. Rodríguez-Hernández Pedro S.

Optimization Methods and Software, Vol. 28, Iss. 6, 2013-12 ,pp. : 1233-1261

Taylor & Francis Ltd

Access to resources Recommend Favorite