A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints

Guanglu Zhou

doi:10.3934/jimo.2007.3.655

Article Contents

2007, Volume 3, Issue 4: 655-670. Doi: 10.3934/jimo.2007.3.655

This issue Previous Article A relaxed extragradient-like method for a class of constrained optimization problem Next Article Levitin-Polyak well-posedness in generalized variational inequality problems with functional constraints

A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints

Guanglu Zhou^1,

1.
Department of Mathematics and Statistics, Curtin University of Technology, West Australia, WA 6102

Received: June 30, 2006

Revised: March 31, 2007

Published: September 2007

Abstract Related Papers Cited by

Abstract

In this paper we present a globally and quadratically convergent method for the problem of minimizing a sum of Euclidean norms with linear constraints. The quadratic convergence result of this method is obtained without requiring strict complementarity.

Keywords:

Mathematics Subject Classification: Primary: 90C33, 90C30; Secondary: 65H10.

Citation:

Article Metrics

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

A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content