Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 199
Volume 199, Number 1, May 2023
- Roberto I. Oliveira, Philip Thompson
:
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints. 1-48 - Roberto I. Oliveira, Philip Thompson:
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso. 49-86 - Dan Garber:
Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity. 87-121 - Renbo Zhao, Robert M. Freund:
Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier. 123-163 - Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, Blake E. Woodworth:
Lower bounds for non-convex stochastic optimization. 165-214 - Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex downgrading to minimize connectivity. 215-249 - Takayuki Okuno, Masao Fukushima:
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints. 251-303 - Anton Rodomanov, Yurii E. Nesterov:
Subgradient ellipsoid method for nonsmooth convex problems. 305-341 - Juan Pablo Contreras, Roberto Cominetti:
Optimal error bounds for non-expansive fixed-point iterations in normed spaces. 343-374 - R. Tyrrell Rockafellar:
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming. 375-420 - Santanu S. Dey, Marco Molinaro, Guanyi Wang:
Solving sparse principal component analysis with global support. 421-459 - Coralia Cartis, Lindon Roberts:
Scalable subspace methods for derivative-free nonlinear least-squares optimization. 461-524 - Melanie Weber, Suvrit Sra:
Riemannian Optimization via Frank-Wolfe Methods. 525-556 - Adrien B. Taylor, Yoel Drori:
An optimal gradient method for smooth strongly convex minimization. 557-594 - I. E. Bardakci, Afrooz Jalilzadeh, Constantino M. Lagoa, Uday V. Shanbhag:
Probability maximization via Minkowski functionals: convex representations and tractable resolution. 595-637 - Zeyang Zhang, Chuanhou Gao, James R. Luedtke:
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem. 639-669 - Andrea Lodi, Mathieu Tanneau, Juan Pablo Vielma:
Disjunctive cuts in Mixed-Integer Conic Optimization. 671-719 - Sen Na, Mihai Anitescu, Mladen Kolar:
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians. 721-791 - Anatoli B. Juditsky, Joon Kwon, Éric Moulines:
Unifying mirror descent and dual averaging. 793-830 - Eitan Levin, Joe Kileel, Nicolas Boumal:
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy. 831-864 - Yann Disser, Oliver Friedmann, Alexander V. Hopp:
An exponential lower bound for Zadeh's pivot rule. 865-936 - Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. 937-993 - Haris Angelidakis, Dylan Hyatt-Denesik, Laura Sanità:
Node connectivity augmentation via iterative randomized rounding. 995-1031 - Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn:
Semi-discrete optimal transport: hardness, regularization and numerical solution. 1033-1106 - Jason M. Altschuler, Enric Boix-Adserà:
Polynomial-time algorithms for multimarginal optimal transport problems with structure. 1107-1178 - David Kozak, Cesare Molinari, Lorenzo Rosasco, Luis Tenorio, Silvia Villa:
Zeroth-order optimization with orthogonal random directions. 1179-1219 - Jean-Pierre Dussault, Jean Charles Gilbert:
Exact computation of an error bound for the balanced linear complementarity problem with unique solution. 1221-1238 - Tien-Son Pham:
Tangencies and polynomial optimization. 1239-1272 - Haishan Ye, Dachao Lin, Xiangyu Chang, Zhihua Zhang:
Towards explicit superlinear convergence rate for SR1. 1273-1303 - Shenglong Hu, Ke Ye:
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations. 1305-1364 - Xiaoxi Jia, Christian Kanzow, Patrick Mehlitz, Gerd Wachsmuth:
An augmented Lagrangian method for optimization problems with structured geometric constraints. 1365-1415 - Lea Kapelevich, Chris Coey, Juan Pablo Vielma:
Sum of squares generalizations for conic sets. 1417-1429
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-14 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
