Algorithms for Mathematical Programming with Emphasis on Bi-level Models
- Columbia University
The research supported by this grant was focused primarily on first-order methods for solving large scale and structured convex optimization problems and convex relaxations of nonconvex problems. These include optimal gradient methods, operator and variable splitting methods, alternating direction augmented Lagrangian methods, and block coordinate descent methods.
- Research Organization:
- Columbia Univ., New York, NY (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- FG02-08ER25856
- OSTI ID:
- 1132080
- Report Number(s):
- DOE-25856-COLUMBIA
- Country of Publication:
- United States
- Language:
- English
Similar Records
The fast cubic algorithm
Distributed Approximate Newton Algorithms and Weight Design for Constrained Optimization
Convex Relaxations of the Network Flow Problem Under Cycle Constraints
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:1132080
Distributed Approximate Newton Algorithms and Weight Design for Constrained Optimization
Journal Article
·
Fri Sep 06 00:00:00 EDT 2019
· Automatica
·
OSTI ID:1132080
Convex Relaxations of the Network Flow Problem Under Cycle Constraints
Journal Article
·
Wed May 08 00:00:00 EDT 2019
· IEEE Transactions on Control of Network Systems
·
OSTI ID:1132080