Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1093.90063
Chen, Jein-Shan; Tseng, Paul
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem. (English)
[J] Math. Program. 104, No. 2-3 (B), 293-327 (2005). ISSN 0025-5610; ISSN 1436-4646/e

Summary: A popular approach to solving the nonlinear complementarity problem (NCP) is to reformulate it as the global minimization of a certain merit function over $\Bbb R^n$. A popular choice of the merit function is the squared norm of the Fischer-Burmeister function, shown to be smooth over $\Bbb R^n$ and, for monotone NCP, each stationary point is a solution of the NCP. This merit function and its analysis were subsequently extended to the semidefinite complementarity problem (SDCP), although only differentiability, not continuous differentiability, was established. In this paper, we extend this merit function and its analysis, including continuous differentiability, to the second-order cone complementarity problem (SOCCP). Although SOCCP is reducible to a SDCP, the reduction does not allow for easy translation of the analysis from SDCP to SOCCP. Instead, our analysis exploits properties of the Jordan product and spectral factorization associated with the second-order cone. We also report preliminary numerical experience with solving DIMACS second-order cone programs using a limited-memory BFGS method to minimize the merit function.

MSC 2000:: *90C33 Complementarity problems
65K05 Mathematical programming (numerical methods)

Keywords: Second-order cone; Complementarity; Merit function; Spectral factorization; Jordan product; Level set; Error bound

Cited in: Zbl 1229.90239 Zbl 1169.49031

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]