Name
Abstract | ||
|---|---|---|
We present a new method for minimizing a strictly convex function subject to general convex constraints. Constraints are used one at a time, no changes are made in the constraint functions (thus the row-action nature of the algorithm) and at each iteration a subproblem is solved consisting of minimization of the objective function subject to one or two linear equations. Convergence of the algorithm is established and the method is compared with other row-action algorithms for several relevant particular cases. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF01582569 | Math. Program. |
Keywords | Field | DocType |
lterative algorithms,convex programming,row-action method,row-action methods,convex function,linear equations,objective function | Mathematical optimization,Convex combination,Subderivative,Random coordinate descent,Proper convex function,Conic optimization,Ellipsoid method,Convex optimization,Mathematics,Convex analysis | Journal |
Volume | Issue | ISSN |
64 | 2 | 1436-4646 |
Citations | PageRank | References |
4 | 1.84 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alfredo N. Iusem | 1 | 374 | 62.67 |
| B. F. Svaiter | 2 | 608 | 72.74 |