Stop the war!
Остановите войну!
for scientists:
default search action
SIAM Journal on Optimization, Volume 34
Volume 34, Number 1, March 2024
- Antonio Bellon, Mareike Dressler, Vyacheslav Kungurtsev, Jakub Marecek, André Uschmajew:
Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization. 1-26 - Nikita Doikov, Konstantin Mishchenko, Yurii E. Nesterov:
Super-Universal Regularized Newton Method. 27-56 - Cédric Josz, Lexiao Lai:
Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size. 57-70 - Jérôme Bolte, Edouard Pauwels, Antonio Silveti-Falls:
Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems. 71-97 - Grigoriy Blekherman, Santanu S. Dey, Shengding Sun:
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity. 98-126 - Zheng Qu, Xindong Tang:
A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization. 127-162 - Alexandre d'Aspremont, Cristóbal Guzmán, Clément Lezane:
Optimal Algorithms for Stochastic Complementary Composite Minimization. 163-189 - Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel:
New Bounds for the Integer Carathéodory Rank. 190-200 - Weiwei Kong, Renato D. C. Monteiro:
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming. 201-224 - Christian Günther, Bahareh Khazayel, Christiane Tammer:
Nonlinear Cone Separation Theorems in Real Topological Linear Spaces. 225-250 - Camille Castera, Hédy Attouch, Jalal Fadili, Peter Ochs:
Continuous Newton-like Methods Featuring Inertia and Variable Mass. 251-277 - Anis Hamadouche, Yun Wu, Andrew M. Wallace, João F. C. Mota:
Sharper Bounds for Proximal Gradient Algorithms with Errors. 278-305 - Hanyang Li, Ying Cui:
A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions. 306-335 - Wenqing Ouyang, Yang Liu, Andre Milzarek:
Descent Properties of an Anderson Accelerated Gradient Method with Restarting. 336-365 - Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae:
Basic Convex Analysis in Metric Spaces with Bounded Curvature. 366-388 - Tianyi Liu, Yifan Lin, Enlu Zhou:
Bayesian Stochastic Gradient Descent for Stochastic Optimization with Streaming Input Data. 389-418 - Nan Jiang, Weijun Xie:
Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers. 419-458 - David L. Applegate, Mateo Díaz, Haihao Lu, Miles Lubin:
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming. 459-484 - Zhe Sun, Lei Wu:
Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization. 485-506 - Tobia Marcucci, Jack Umenberger, Pablo A. Parrilo, Russ Tedrake:
Shortest Paths in Graphs of Convex Sets. 507-532 - Maël Forcier, Stéphane Gaubert, Vincent Leclère:
Exact Quantization of Multistage Stochastic Linear Problems. 533-562 - Xiaozhou Wang, Ting Kei Pong:
Convergence Rate Analysis of a Dykstra-Type Projection Algorithm. 563-589 - Sergio Cristancho, Mauricio Velasco:
Harmonic Hierarchies for Polynomial Optimization. 590-615 - Ulysse Marteau-Ferey, Francis R. Bach, Alessandro Rudi:
Second Order Conditions to Decompose Smooth Functions as Sums of Squares. 616-641 - Honglin Luo, Xianfu Wang, Xinmin Yang:
Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions. 642-653 - Wutao Si, Pierre-Antoine Absil, Wen Huang, Rujun Jiang, Simon Vary:
A Riemannian Proximal Newton Method. 654-681 - Güzin Bayraksan, Francesca Maggioni, Daniel Faccini, Ming Yang:
Bounds for Multistage Mixed-Integer Distributionally Robust Optimization. 682-717 - Mengmeng Song, Yong Xia:
Linear Programming on the Stiefel Manifold. 718-741 - Leon Eifler, Ambros M. Gleixner:
Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework. 742-763 - Haoya Li, Hsiang-Fu Yu, Lexing Ying, Inderjit S. Dhillon:
Accelerating Primal-Dual Methods for Regularized Markov Decision Processes. 764-789 - Nadav Hallak:
A Path-Based Approach to Constrained Sparse Optimization. 790-816 - Walid Ben-Ameur:
Subset Selection and the Cone of Factor-Width-k Matrices. 817-843 - Johannes Milz, Michael Ulbrich:
Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization. 844-869 - Shaoning Han, Jong-Shi Pang:
Continuous Selections of Solutions to Parametric Variational Inequalities. 870-892 - Karl Welzel, Raphael A. Hauser:
Approximating Higher-Order Derivative Tensors Using Secant Updates. 893-917 - Nguyen Thi Van Hang, M. Ebrahim Sarabi:
A Chain Rule for Strict Twice Epi-Differentiability and Its Applications. 918-945 - Sihan Zeng, Thinh T. Doan, Justin Romberg:
A Two-Time-Scale Stochastic Optimization Framework with Applications in Control and Reinforcement Learning. 946-976 - Gábor Pataki, Aleksandr Touzov:
How Do Exponential Size Solutions Arise in Semidefinite Programming? 977-1005 - Yangyang Xu:
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems. 1006-1044 - Deren Han, Yansheng Su, Jiaxin Xie:
Randomized Douglas-Rachford Methods for Linear Systems: Improved Accuracy and Efficiency. 1045-1070 - Frank de Meijer, Renata Sotirov:
On Integrality in Semidefinite Programming for Discrete Optimization. 1071-1096
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.