𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems

✍ Scribed by Yong-Jin Liu; Li-Wei Zhang

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
311 KB
Volume
67
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Log-Sigmoid nonlinear Lagrange method fo
Log-Sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones
✍ Jian Gu; Liwei Zhang; Xiantao Xiao πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 862 KB

This paper analyzes the rate of local convergence of the Log-Sigmoid nonlinear Lagrange method for nonconvex nonlinear second-order cone programming. Under the componentwise strict complementarity condition, the constraint nondegeneracy condition and the second-order sufficient condition, we show th

Solution of nonlinear boundary value pro
Solution of nonlinear boundary value problems β€” I method of third order convergence for solution of nonlinear two-point boundary value problems single second order equation
✍ Milan Kubíček; VladimΓ­mir HlavΓ‘Δ›k πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 306 KB

procedure towards solution of two-point nonlinear boundary value problems for single equation of second order is described. For the correction of missing conditions two algorithms of 3rd order convergence are suggested and, in addition, a comparison with Newton root-finding method is presented. The

A descent method for a reformulation of
A descent method for a reformulation of the second-order cone complementarity problem
✍ Jein-Shan Chen; Shaohua Pan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 196 KB

Analogous to the nonlinear complementarity problem and the semi-definite complementarity problem, a popular approach to solving the second-order cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over R n . In this paper, we present