Entity usage

Showing below up to 50 results in range #1 to #50.

1. On the directional asymptotic approach in optimization theory: Label: en
2. An asynchronous proximal bundle method: Label: en
3. Stackelberg risk preference design: Label: en
4. Finding global minima via kernel approximations: Label: en
5. A normal fan projection algorithm for low-rank optimization: Label: en
6. Sample complexity analysis for adaptive optimization algorithms with stochastic oracles: Label: en
7. Perseus: a simple and optimal high-order method for variational inequalities: Label: en
8. Non-convex scenario optimization: Label: en
9. Accelerated first-order methods for a class of semidefinite programs: Label: en
10. Sum-of-squares relaxations for polynomial min-max problems over simple sets: Label: en
11. Convergence rates for sums-of-squares hierarchies with correlative sparsity: Label: en
12. Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations: Label: en
13. The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization: Label: en
14. Generalized minimum 0-extension problem and discrete convexity: Label: en
15. Generalized Nash equilibrium problems with mixed-integer variables: Label: en
16. Hessian barrier algorithms for non-convex conic optimization: Label: en
17. Automated tight Lyapunov analysis for first-order methods: Label: en
18. Convex hulls of monomial curves, and a sparse positivstellensatz: Label: en
19. The effect of smooth parametrizations on nonconvex optimization landscapes: Label: en
20. Level constrained first order methods for function constrained optimization: Label: en
21. Deciding whether a lattice has an orthonormal basis is in co-NP: Label: en
22. Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems: Label: en
23. Designing tractable piecewise affine policies for multi-stage adjustable robust optimization: Label: en
24. Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization: Label: en
25. Adjustability in robust linear optimization: Label: en
26. Constrained optimization of rank-one functions with indicator variables: Label: en
27. Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming: Label: en
28. FPT algorithms for a special block-structured integer program with applications in scheduling: Label: en
29. Asymmetry in the complexity of the multi-commodity network pricing problem: Label: en
30. Counterexample and an additional revealing poll step for a result of ``Analysis of direct searches for discontinuous functions: Label: en
31. High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods: Label: en
32. Complementary composite minimization, small gradients in general norms, and applications: Label: en
33. Hardness and approximation of submodular minimum linear ordering problems: Label: en
34. The exact worst-case convergence rate of the alternating direction method of multipliers: Label: en
35. First order asymptotics of the sample average approximation method to solve risk averse stochastic programs: Label: en
36. A single cut proximal bundle method for stochastic convex composite optimization: Label: en
37. Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings: Label: en
38. A general framework for multi-marginal optimal transport: Label: en
39. No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians: Label: en
40. Beyond symmetry: best submatrix selection for the sparse truncated SVD: Label: en
41. Short-step methods are not strongly polynomial-time: Label: en
42. A polynomial time algorithm for finding a minimum 4-partition of a submodular function: Label: en
43. New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming: Label: en
44. State polynomials: positivity, optimization and nonlinear Bell inequalities: Label: en
45. Correction to: ``Efficient Kirszbraun extension with applications to regression: Label: en
46. Efficient Kirszbraun extension with applications to regression: Label: en
47. Relaxations and duality for multiobjective integer programming: Label: en
48. Global stability of first-order methods for coercive tame functions: Label: en
49. Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation: Label: en
50. Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity: Label: en