Works matching IS 00255610 AND DT 2022 AND VI 191 AND IP 2
Results: 15
A hybrid stochastic optimization framework for composite nonconvex optimization.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 1005, doi. 10.1007/s10107-020-01583-1
- By:
- Publication type:
- Article
Sparse PSD approximation of the PSD cone.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 981, doi. 10.1007/s10107-020-01578-y
- By:
- Publication type:
- Article
General bounds for incremental maximization.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 953, doi. 10.1007/s10107-020-01576-0
- By:
- Publication type:
- Article
Optimal sampled-data controls with running inequality state constraints: Pontryagin maximum principle and bouncing trajectory phenomenon.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 907, doi. 10.1007/s10107-020-01574-2
- By:
- Publication type:
- Article
A stability result for linear Markovian stochastic optimization problems.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 871, doi. 10.1007/s10107-020-01573-3
- By:
- Publication type:
- Article
Performance guarantees of local search for minsum scheduling problems.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 847, doi. 10.1007/s10107-020-01571-5
- By:
- Publication type:
- Article
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 795, doi. 10.1007/s10107-020-01570-6
- By:
- Publication type:
- Article
Stochastic Lipschitz dynamic programming.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 755, doi. 10.1007/s10107-020-01569-z
- By:
- Publication type:
- Article
Complexity of stochastic dual dynamic programming.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 717, doi. 10.1007/s10107-020-01567-1
- By:
- Publication type:
- Article
Accelerating variance-reduced stochastic gradient methods.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 671, doi. 10.1007/s10107-020-01566-2
- By:
- Publication type:
- Article
Projective splitting with forward steps.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 631, doi. 10.1007/s10107-020-01565-3
- By:
- Publication type:
- Article
Convex graph invariant relaxations for graph edit distance.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 595, doi. 10.1007/s10107-020-01564-4
- By:
- Publication type:
- Article
New limits of treewidth-based tractability in optimization.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 559, doi. 10.1007/s10107-020-01563-5
- By:
- Publication type:
- Article
The generalized trust region subproblem: solution complexity and convex hull results.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 445, doi. 10.1007/s10107-020-01560-8
- By:
- Publication type:
- Article
Complete positivity and distance-avoiding sets.
- Published in:
- Mathematical Programming, 2022, v. 191, n. 2, p. 487, doi. 10.1007/s10107-020-01562-6
- By:
- Publication type:
- Article