Skip to Main content Skip to Navigation
Reports

Proximal-Point Algorithm for Minimizing Quadratic Functions

Guillaume Vige 1
1 PROMATH - Mathematical Programming
Inria Paris-Rocquencourt
Abstract : The proximal-point algorithm is studied in the framework of the minimization of a quadratic function. In this context it can also be used to compute the least eigenvalue of the hessian and an associated eigenvector. The speed of convergence is analysed and a connection with the power method is pointed out. A modified algorithm with quadratic convergen- ce is studied. Numerical tests assess the theoretical results
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074075
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:26:36 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Monday, April 5, 2010 - 12:04:26 AM

Identifiers

  • HAL Id : inria-00074075, version 1

Collections

Citation

Guillaume Vige. Proximal-Point Algorithm for Minimizing Quadratic Functions. [Research Report] RR-2610, INRIA. 1995. ⟨inria-00074075⟩

Share

Metrics

Record views

153

Files downloads

234