On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds
In this work we define a block decomposition Jacobi-type method for nonlinear optimization problems with one linear constraint and bound constraints on the variables. We prove convergence of the method to stationary points of the problem under quite general assumptions.
Year of publication: |
2010-01
|
---|---|
Authors: | Liuzzi, Giampaolo ; Palagi, Laura ; Piacentini, Mauro |
Institutions: | Dipartimento di Ingegneria Informatica, Automatica e Gestionale "Antonio Ruberti", Facoltà di Ingegneria dell'Informazione Informatica e Statistica |
Subject: | Decomposition method Jacobi-type iteration |
Saved in:
freely available
Extent: | application/pdf |
---|---|
Series: | DIS Technical Reports. - ISSN 2035-5750. |
Type of publication: | Book / Working Paper |
Notes: | Number 2010-01 16 pages |
Source: |
Persistent link: https://www.econbiz.de/10010597750
Saved in favorites
Similar items by person
-
An unconstrained approach for solving low rank SDP relaxations of {-1,1} quadratic problems
Grippo, Luigi, (2009)
-
An Exact Algorithm for Quadratic Integer Minimization using Nonconvex Relaxations
Buchheim, Christoph, (2012)
-
Design of induction motors using a mixed-variable approach
Liuzzi, Giampaolo, (2005)
- More ...