Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 1, doi. 10.1007/s10107-008-0261-6
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2011 AND VI 126 AND IP 1
Results: 9
1
2
A polynomial oracle-time algorithm for convex integer minimization.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 97, doi. 10.1007/s10107-009-0276-7
- By:
- Publication type:
- Article
3
A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 31, doi. 10.1007/s10107-009-0268-7
- By:
- Publication type:
- Article
4
A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 193, doi. 10.1007/s10107-009-0271-z
- By:
- Publication type:
- Article
5
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 119, doi. 10.1007/s10107-009-0275-8
- By:
- Publication type:
- Article
6
Orbital branching.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 147, doi. 10.1007/s10107-009-0273-x
- By:
- Publication type:
- Article
7
A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 179, doi. 10.1007/s10107-009-0270-0
- By:
- Publication type:
- Article
8
Erratum to: The capacitated max k-cut problem.
- Published in:
- 2011
- By:
- Publication type:
- Correction Notice
9
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems.
- Published in:
- Mathematical Programming, 2011, v. 126, n. 1, p. 69, doi. 10.1007/s10107-009-0274-9
- By:
- Publication type:
- Article