Stability of Lagrangian Duality for Nonconvex Quadratic Programming Solution Methods and Applications in Computer Vision

Abstract : The problem of minimizing a quadratic form over a ball centered at the origin is considered. The stability of Lagrangian duality is established and complete characterizations of a global optimal solution are given. On the basis of this theoretical study, two principal solution methods are presented. An important application of nonconvex quadratic programming is the computation of the step to a new iterate in the Trust Region(TR) approach methods which are known to be efficient for nonlinear optimization problems. Also, we discuss themathematical models of some important problems encountered in Computer Vision. Most of them can be formulated as a mimmization of a sum of squares of nonlinear functions. A practical TR-based algorithm is proposed for nonlinear least squares problem which seems to be well suited for our applications.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00590068
Contributor : Team Perception <>
Submitted on : Tuesday, May 3, 2011 - 9:14:43 AM
Last modification on : Tuesday, February 5, 2019 - 11:24:15 AM

Identifiers

  • HAL Id : inria-00590068, version 1

Citation

Pham-Dinh Tao, Thai-Quynh Phong, Radu Horaud, Long Quan. Stability of Lagrangian Duality for Nonconvex Quadratic Programming Solution Methods and Applications in Computer Vision. [Research Report] 1996, pp.35. ⟨inria-00590068⟩

Share

Metrics

Record views

142