Higher-order sensitivity analysis in nonconvexvector optimization

Qilin Wang; S. J. Li

doi:10.3934/jimo.2010.6.381

Article Contents

2010, Volume 6, Issue 2: 381-392. Doi: 10.3934/jimo.2010.6.381

This issue Previous Article Smoothing Newton algorithm based on a regularized one-parametric class of smoothing functions for generalized complementarity problems over symmetric cones Next Article A note on: Spline technique for modeling roadway profile to minimize earthwork cost

Higher-order sensitivity analysis in nonconvex vector optimization

Qilin Wang^1, and
S. J. Li^2,

1.
College of Mathematics and Science, Chongqing University, Chongqing 400044
2.
College of Mathematics and Science, Chongqing University, Chongqing, 400044

Received: April 30, 2009

Revised: December 31, 2009

Published: March 2010

Abstract Related Papers Cited by

Abstract

This paper deals with higher-order sensitivity analysis in nonconvex vector optimization. By virtue of higher-order adjacent derivatives introduced in (Aubin and Frankowska, Set-valued Analysis, Birkh$\ddot{a}$user, Boston, 1990), relationships between higher-order derivatives of a set-valued map and its profile map are discussed. Some results concerning higher-order sensitivity analysis are obtained in nonconvex vector optimization.

Keywords:

Mathematics Subject Classification: 90C26, 90C31, 49J53.

Citation:

Article Metrics

HTML views() PDF downloads(107) Cited by(0)

Higher-order sensitivity analysis in nonconvex vector optimization

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Higher-order sensitivity analysis in nonconvex vector optimization

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content