Gradient methods for minimizing composite functions.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 125, doi. 10.1007/s10107-012-0629-5
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2013 AND VI 140 AND IP 1
Results: 9
1
2
The proximal Chebychev center cutting plane algorithm for convex additive functions.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 163, doi. 10.1007/s10107-012-0630-z
- By:
- Publication type:
- Article
3
Semidefinite relaxations of ordering problems.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 77, doi. 10.1007/s10107-012-0627-7
- By:
- Publication type:
- Article
4
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 99, doi. 10.1007/s10107-012-0628-6
- By:
- Publication type:
- Article
5
Composite proximal bundle method.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 189, doi. 10.1007/s10107-012-0600-5
- By:
- Publication type:
- Article
6
Preface.
- Published in:
- 2013
- By:
- Publication type:
- Editorial
7
Testing copositivity with the help of difference-of-convex optimization.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 31, doi. 10.1007/s10107-012-0625-9
- By:
- Publication type:
- Article
8
Semi-algebraic functions have small subdifferentials.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 5, doi. 10.1007/s10107-012-0624-x
- By:
- Publication type:
- Article
9
A stabilized structured Dantzig-Wolfe decomposition method.
- Published in:
- Mathematical Programming, 2013, v. 140, n. 1, p. 45, doi. 10.1007/s10107-012-0626-8
- By:
- Publication type:
- Article