Works matching IS 00255610 AND DT 2023 AND VI 199 AND IP 1/2
Results: 32
Polynomial-time algorithms for multimarginal optimal transport problems with structure.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1107, doi. 10.1007/s10107-022-01868-7
- By:
- Publication type:
- Article
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1305, doi. 10.1007/s10107-022-01867-8
- By:
- Publication type:
- Article
An augmented Lagrangian method for optimization problems with structured geometric constraints.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1365, doi. 10.1007/s10107-022-01870-z
- By:
- Publication type:
- Article
Tangencies and polynomial optimization.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1239, doi. 10.1007/s10107-022-01869-6
- By:
- Publication type:
- Article
Zeroth-order optimization with orthogonal random directions.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1179, doi. 10.1007/s10107-022-01866-9
- By:
- Publication type:
- Article
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 49, doi. 10.1007/s10107-023-01940-w
- By:
- Publication type:
- Article
Towards explicit superlinear convergence rate for SR1.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1273, doi. 10.1007/s10107-022-01865-w
- By:
- Publication type:
- Article
Exact computation of an error bound for the balanced linear complementarity problem with unique solution.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1221, doi. 10.1007/s10107-022-01860-1
- By:
- Publication type:
- Article
Probability maximization via Minkowski functionals: convex representations and tractable resolution.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 595, doi. 10.1007/s10107-022-01859-8
- By:
- Publication type:
- Article
Solving sparse principal component analysis with global support.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 421, doi. 10.1007/s10107-022-01857-w
- By:
- Publication type:
- Article
Semi-discrete optimal transport: hardness, regularization and numerical solution.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1033, doi. 10.1007/s10107-022-01856-x
- By:
- Publication type:
- Article
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 639, doi. 10.1007/s10107-022-01847-y
- By:
- Publication type:
- Article
A convergence analysis of the price of anarchy in atomic congestion games.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 937, doi. 10.1007/s10107-022-01853-0
- By:
- Publication type:
- Article
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 831, doi. 10.1007/s10107-022-01851-2
- By:
- Publication type:
- Article
Unifying mirror descent and dual averaging.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 793, doi. 10.1007/s10107-022-01850-3
- By:
- Publication type:
- Article
An exponential lower bound for Zadeh's pivot rule.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 865, doi. 10.1007/s10107-022-01848-x
- By:
- Publication type:
- Article
Node connectivity augmentation via iterative randomized rounding.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 995, doi. 10.1007/s10107-022-01854-z
- By:
- Publication type:
- Article
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 721, doi. 10.1007/s10107-022-01846-z
- By:
- Publication type:
- Article
Disjunctive cuts in Mixed-Integer Conic Optimization.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 671, doi. 10.1007/s10107-022-01844-1
- By:
- Publication type:
- Article
Riemannian Optimization via Frank-Wolfe Methods.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 525, doi. 10.1007/s10107-022-01840-5
- By:
- Publication type:
- Article
An optimal gradient method for smooth strongly convex minimization.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 557, doi. 10.1007/s10107-022-01839-y
- By:
- Publication type:
- Article
Scalable subspace methods for derivative-free nonlinear least-squares optimization.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 461, doi. 10.1007/s10107-022-01836-1
- By:
- Publication type:
- Article
Subgradient ellipsoid method for nonsmooth convex problems.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 305, doi. 10.1007/s10107-022-01833-4
- By:
- Publication type:
- Article
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 375, doi. 10.1007/s10107-022-01832-5
- By:
- Publication type:
- Article
Sum of squares generalizations for conic sets.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1417, doi. 10.1007/s10107-022-01831-6
- By:
- Publication type:
- Article
Optimal error bounds for non-expansive fixed-point iterations in normed spaces.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 343, doi. 10.1007/s10107-022-01830-7
- By:
- Publication type:
- Article
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 251, doi. 10.1007/s10107-022-01827-2
- By:
- Publication type:
- Article
Vertex downgrading to minimize connectivity.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 215, doi. 10.1007/s10107-022-01824-5
- By:
- Publication type:
- Article
Lower bounds for non-convex stochastic optimization.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 165, doi. 10.1007/s10107-022-01822-7
- By:
- Publication type:
- Article
Linear convergence of Frank–Wolfe for rank-one matrix recovery without strong convexity.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 87, doi. 10.1007/s10107-022-01821-8
- By:
- Publication type:
- Article
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 123, doi. 10.1007/s10107-022-01820-9
- By:
- Publication type:
- Article
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints.
- Published in:
- Mathematical Programming, 2023, v. 199, n. 1/2, p. 1, doi. 10.1007/s10107-022-01810-x
- By:
- Publication type:
- Article