Special Issue: International Symposium on Mathematical Programming 2022.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 629, doi. 10.1007/s10107-023-01990-0
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2023 AND VI 200 AND IP 2
Results: 8
1
2
Robust convex optimization: A new perspective that unifies and extends.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 877, doi. 10.1007/s10107-022-01881-w
- By:
- Publication type:
- Article
3
Simple and fast algorithm for binary integer and online linear programming.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 831, doi. 10.1007/s10107-022-01880-x
- By:
- Publication type:
- Article
4
Global optimization using random embeddings.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 781, doi. 10.1007/s10107-022-01871-y
- By:
- Publication type:
- Article
5
Complexity of optimizing over the integers.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 739, doi. 10.1007/s10107-022-01862-z
- By:
- Publication type:
- Article
6
Graphical designs and gale duality.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 703, doi. 10.1007/s10107-022-01861-0
- By:
- Publication type:
- Article
7
A graph-based decomposition method for convex quadratic optimization with indicators.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 669, doi. 10.1007/s10107-022-01845-0
- By:
- Publication type:
- Article
8
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 2, p. 633, doi. 10.1007/s10107-022-01843-2
- By:
- Publication type:
- Article