The prize honors George B. Dantzig for his contributions to operations research and computer science. The prize is awarded every three years to one or more individuals for original research which by its originality, breadth, and depth is having a major impact on the field of mathematical optimization. SIAM is accepting nominations for the 2021 award.
This prize was created in 2013 to emphasize George Pólya’s legacy of communicating mathematics effectively. It joins two long-standing Pólya prizes SIAM has awarded in combinatorics and other fields beginning in 1969.
The Lagrange Prize in Continuous Optimization is awarded every three years by the Mathematical Optimization Society (MOS) and SIAM for an outstanding contribution in the area of continuous optimization published in the six calendar years preceding the award year. SIAM is accepting nominations for the 2021 award.
Established in 1998 in memory of Ralph E. Kleinman, the prize recognizes contributions that bridge the gap between high-level mathematics and engineering problems. The award is based on the quality and impact of the mathematics.
This joint prize was established in 2002 to honor Sonia Kovalevsky and her work on the theory of differential equations. It is awarded to anyone in the scientific or engineering community whose work highlights the achievements of women in applied and computational mathematics. Nominations can be submitted via the AWM website.
Berkeley, CA, United States
By Junyi Liu, Ying Cui, Jong-Shi Pang, and Suvrajeet SenSIAM Journal on Optimization, Volume 30, Issue 3, Page 2530-2558, January 2020. This paper studies the class of two-stage stochastic programs with a linearly bi-parameterized recourse function defined by...
By Maher Nouiehed and Meisam RazaviyaynSIAM Journal on Optimization, Volume 30, Issue 3, Page 2501-2529, January 2020. Motivated by the TRACE algorithm [F. E. Curtis, D. P. Robinson, and M. Samadi, Math. Program., 162...
By Immanuel M. Bomze, Francesco Rinaldi, and Damiano ZeffiroSIAM Journal on Optimization, Volume 30, Issue 3, Page 2470-2500, January 2020. In this paper, we study active set identification results for the away-step Frank--Wolfe algorithm in different settings....
...
This is the meeting of the SIAM Activity Group on Optimization. The following meetings will be held jointly: SIAM Annual Meeting (AN21) SIAM Conference on Applied and Computational ...
Society for Industrial and Applied Mathematics ...
By Federico Bassetti, Stefano Gualandi, and Marco VeneroniSIAM Journal on Optimization, Volume 30, Issue 3, Page 2441-2469, January 2020. In this work, we present a method to compute the Kantorovich--Wasserstein distance of order 1 between a...
By Xudong Li, Defeng Sun, and Kim-Chuan TohSIAM Journal on Optimization, Volume 30, Issue 3, Page 2410-2440, January 2020. Powerful interior-point methods (IPM) based commercial solvers, such as Gurobi and Mosek, have been hugely successful in...
Oak Ridge, TN, United States
Boston, MA, United States
Have you read a highly-cited SIAM journal ...
Somerville, MA, United States
By Ashkan Mohammadi and M. Ebrahim SarabiSIAM Journal on Optimization, Volume 30, Issue 3, Page 2379-2409, January 2020. The paper is devoted to the study of the twice epi-differentiablity of extended-real-valued functions, with an emphasis...
By Alexander S. Estes and Michael O. BallSIAM Journal on Optimization, Volume 30, Issue 3, Page 2355-2378, January 2020. We study a type of network flow problem that we call the minimum-cost F-graph flow problem. This...
By Mohammad FarazmandSIAM Journal on Optimization, Volume 30, Issue 3, Page 2337-2354, January 2020. Accelerated gradient descent iterations are widely used in optimization. It is known that, in the continuous-time limit,...
By Olivier Beaude, Pascal Benchimol, Stéphane Gaubert, Paulin Jacquot, and Nadia OudjaneSIAM Journal on Optimization, Volume 30, Issue 3, Page 2303-2336, January 2020. We consider a resource allocation problem involving a large number of agents with individual constraints subject to...
By Jiawei Zhang and Zhi-Quan LuoSIAM Journal on Optimization, Volume 30, Issue 3, Page 2272-2302, January 2020. Consider the minimization of a nonconvex differentiable function over a bounded polyhedron. A popular primal-dual first-order method...
By Ernest K. Ryu, Adrien B. Taylor, Carolina Bergeling, and Pontus GiselssonSIAM Journal on Optimization, Volume 30, Issue 3, Page 2251-2271, January 2020. We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove...
By Constantin Christof, Juan Carlos De los Reyes, and Christian MeyerSIAM Journal on Optimization, Volume 30, Issue 3, Page 2163-2196, January 2020. We propose a general trust-region method for the minimization of nonsmooth and nonconvex, locally Lipschitz continuous functions...
By Yangjing Zhang, Ning Zhang, Defeng Sun, and Kim-Chuan TohSIAM Journal on Optimization, Volume 30, Issue 3, Page 2197-2220, January 2020. Undirected graphical models have been especially popular for learning the conditional independence structure among a large number...
By Alejandra Peña-Ordieres, James R. Luedtke, and Andreas WächterSIAM Journal on Optimization, Volume 30, Issue 3, Page 2221-2250, January 2020. We introduce a new method for solving nonlinear continuous optimization problems with chance constraints. Our method is...
By Samir Adly and Hedy AttouchSIAM Journal on Optimization, Volume 30, Issue 3, Page 2134-2162, January 2020. In a Hilbert space ${\mathcal H}$, we introduce a new class of proximal-gradient algorithms with finite...
By Yifan Hu, Xin Chen, and Niao HeSIAM Journal on Optimization, Volume 30, Issue 3, Page 2103-2133, January 2020. In this paper, we study a class of stochastic optimization problems, referred to as the conditional stochastic...
By Patrick De LeenheerSIAM Review, Volume 62, Issue 3, Page 716-726, January 2020. We present an elementary proof of a generalization of Kirchhoff's matrix tree theorem to directed, weighted graphs. The proof...
By Lek-Heng LimSIAM Review, Volume 62, Issue 3, Page 685-715, January 2020. This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian....
By Andrii Mironchenko and Christophe PrieurSIAM Review, Volume 62, Issue 3, Page 529-614, January 2020. In a pedagogical but exhaustive manner, this survey reviews the main results on input-to-state stability (ISS) for infinite-dimensional systems....
By Ernesto Estrada, Gissell Estrada-Rodriguez, and Heiko GimperleinSIAM Review, Volume 62, Issue 3, Page 617-645, January 2020. In a complex system, the interplay between the internal structure of its entities and their interconnection may play a...
By Jed A. Duersch and Ming GuSIAM Review, Volume 62, Issue 3, Page 661-682, January 2020. Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and...
By Vicky Chuqiao Yang, Daniel M. Abrams, Georgia Kernell, and Adilson E. MotterSIAM Review, Volume 62, Issue 3, Page 646-657, January 2020. Since the 1960s, Democrats and Republicans in the U.S. Congress have taken increasingly polarized positions, while the public's policy...
By Darinka DentchevaSIAM Review, Volume 62, Issue 3, Page 683-683, January 2020. This issue of SIAM Review contains two papers in the Education section. The first paper, “Hodge Laplacians on Graphs,”...
By Misha E. KilmerSIAM Review, Volume 62, Issue 3, Page 615-615, January 2020. In this issue, Research Spotlights features two exciting and topically diverse articles. The authors of the first article...
By J. M. Sanz-SernaSIAM Review, Volume 62, Issue 3, Page 527-527, January 2020. Andrii Mirochenko and Christophe Prieur are the authors of “Input-to-State Stability of Infinite-Dimensional Systems: Recent Results and Open Questions,”...
By Volker H. SchulzSIAM Review, Volume 62, Issue 3, Page 729-739, January 2020. These are difficult times, but some circumstances make the work in our Book Reviews section even more difficult. Due...
By The EditorsSIAM Review, Volume 62, Issue 3, Page 659-659, January 2020. The SIGEST article in this issue, “Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations,” by Jed A. Duersch...
By Alexander Shapiro and Lingquan DingSIAM Journal on Optimization, Volume 30, Issue 3, Page 2083-2102, January 2020. In some applications the considered multistage stochastic programs have a periodical behavior. We show that in such...
By Rui Peng LiuSIAM Journal on Optimization, Volume 30, Issue 3, Page 2026-2052, January 2020. When there are infinitely many scenarios, the current studies of two-stage stochastic programming problems rely on the...
By Etienne De Klerk, François Glineur, and Adrien B. TaylorSIAM Journal on Optimization, Volume 30, Issue 3, Page 2053-2082, January 2020. We provide new tools for worst-case performance analysis of the gradient (or steepest descent) method of Cauchy...
By Johannes Milz and Michael UlbrichSIAM Journal on Optimization, Volume 30, Issue 3, Page 1996-2025, January 2020. We consider distributionally robust optimization problems (DROPs) with nonlinear and nonconcave dependence on uncertain parameters. The DROP...
By Jiulin Wang and Yong XiaSIAM Journal on Optimization, Volume 30, Issue 3, Page 1980-1995, January 2020. The trust region subproblem has at most one local nonglobal minimizer. In characterizing this local solution, there...
By Mehiddin Al-Baali, Andrea Caliciotti, Giovanni Fasano, and Massimo RomaSIAM Journal on Optimization, Volume 30, Issue 3, Page 1954-1979, January 2020. We introduce a class of positive definite preconditioners for the solution of large symmetric indefinite linear systems...
By Daniel Luft, Volker H. Schulz, and Kathrin WelkerSIAM Journal on Optimization, Volume 30, Issue 3, Page 1922-1953, January 2020. In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semismooth shape optimization...
By Guoyong Gu and Junfeng YangSIAM Journal on Optimization, Volume 30, Issue 3, Page 1905-1921, January 2020. The tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems is established...
By Anton Rodomanov and Dmitry KropotovSIAM Journal on Optimization, Volume 30, Issue 3, Page 1878-1904, January 2020. We analyze the coordinate descent method with a new coordinate selection strategy, called volume sampling. This strategy...
By O. Sebbouh, Ch. Dossal, and A. RondepierreSIAM Journal on Optimization, Volume 30, Issue 3, Page 1850-1877, January 2020. In this article a family of second-order ODEs associated with the inertial gradient descent is studied. These...
By James V. Burke, Frank E. Curtis, Hao Wang, and Jiashan WangSIAM Journal on Optimization, Volume 30, Issue 3, Page 1822-1849, January 2020. This paper focuses on the design of sequential quadratic optimization (commonly known as SQP) methods for solving...
By Tien-Son PhamSIAM Journal on Optimization, Volume 30, Issue 3, Page 1777-1794, January 2020. Consider a semialgebraic function $f\colon\mathbb{R}^n \to {\mathbb{R}},$ which is continuous around a point $\bar{x} \in \mathbb{R}^n.$ Using...
By Huan Li and Zhouchen LinSIAM Journal on Optimization, Volume 30, Issue 3, Page 1795-1821, January 2020. EXTRA is a popular method for dencentralized distributed optimization and has broad applications. This paper revisits EXTRA....
By Yulan Liu, Shujun Bi, and Shaohua PanSIAM Journal on Optimization, Volume 30, Issue 2, Page 1756-1775, January 2020. For the rank regularized minimization problem, we introduce several classes of stationary points by the problem itself...
By Nguyen Thanh Qui and Daniel WachsmuthSIAM Journal on Optimization, Volume 30, Issue 2, Page 1724-1755, January 2020. This paper studies generalized differentiability properties of the marginal function of parametric optimal control problems governed by...
By Francesco Caruso, Maria Carmela Ceparano, and Jacqueline MorganSIAM Journal on Optimization, Volume 30, Issue 2, Page 1638-1663, January 2020. Regarding the approximation of Nash equilibria in games where the players have a continuum of strategies, there...
By Ying Cui, Ziyu He, and Jong-Shi PangSIAM Journal on Optimization, Volume 30, Issue 2, Page 1693-1723, January 2020. We present in this paper a novel deterministic algorithmic framework that enables the computation of a directional...
By Yangyang XuSIAM Journal on Optimization, Volume 30, Issue 2, Page 1664-1692, January 2020. The stochastic gradient method (SGM) has been popularly applied to solve optimization problems with an objective that...
By Elias S. Helou, Sandra A. Santos, and Lucas E. A. Simo͂esSIAM Journal on Optimization, Volume 30, Issue 2, Page 1610-1637, January 2020. We introduce a sequential optimality condition for locally Lipschitz constrained nonsmooth optimization, verifiable just using derivative information,...
By James Luedtke, Claudia D'Ambrosio, Jeff Linderoth, and Jonas SchweigerSIAM Journal on Optimization, Volume 30, Issue 2, Page 1582-1609, January 2020. We investigate new convex relaxations for the pooling problem, a classic nonconvex production planning problem in which...
By Andreas Fischer, Alexey F. Izmailov, and Wladimir ScheckSIAM Journal on Optimization, Volume 30, Issue 2, Page 1555-1581, January 2020. It is a well-known phenomenon that the presence of critical Lagrange multipliers in constrained optimization problems may...
By Sen Na and Mihai AnitescuSIAM Journal on Optimization, Volume 30, Issue 2, Page 1527-1554, January 2020. In this paper, we study the sensitivity of discrete-time dynamic programs with nonlinear dynamics and objective to...
By Lihua Lei and Michael I. JordanSIAM Journal on Optimization, Volume 30, Issue 2, Page 1473-1500, January 2020. Stochastic gradient-based optimization has been a core enabling methodology in applications to large-scale problems in machine learning...
By Thai Doan ChuongSIAM Journal on Optimization, Volume 30, Issue 2, Page 1501-1526, January 2020. In this paper, we employ advanced techniques of variational analysis and generalized differentiation to examine robust optimality...
By Yura Malitsky and Matthew K. TamSIAM Journal on Optimization, Volume 30, Issue 2, Page 1451-1472, January 2020. In this work, we propose a simple modification of the forward-backward splitting method for finding a zero...
By Bangti Jin, Zehui Zhou, and Jun ZouSIAM Journal on Optimization, Volume 30, Issue 2, Page 1421-1450, January 2020. In this work, we analyze the regularizing property of the stochastic gradient descent for the numerical solution...
By Tuomo ValkonenSIAM Journal on Optimization, Volume 30, Issue 2, Page 1391-1420, January 2020. We study inertial versions of primal-dual proximal splitting, also known as the Chambolle--Pock method. Our starting point...
By J. Chen, X. Wang, and C. PlanidenSIAM Journal on Optimization, Volume 30, Issue 2, Page 1366-1390, January 2020. We construct a proximal average for two prox-bounded functions, which recovers the classical proximal average for two...
By Benjamin Müller, Felipe Serrano, and Ambros GleixnerSIAM Journal on Optimization, Volume 30, Issue 2, Page 1339-1365, January 2020. One of the most fundamental ingredients in mixed-integer nonlinear programming solvers is the well-known McCormick relaxation for...
By Ling Guo, Akil Narayan, and Tao ZhouSIAM Review, Volume 62, Issue 2, Page 483-508, January 2020. Polynomial approximations constructed using a least-squares approach form a ubiquitous technique in numerical computation. One of the simplest ways...
By Lloyd N. TrefethenSIAM Review, Volume 62, Issue 2, Page 439-462, January 2020. Boundary-value problems involving the linear differential equation $\varepsilon y'' - x y' + y = 0$ have surprising properties...
By Yair Carmon and John C. DuchiSIAM Review, Volume 62, Issue 2, Page 395-436, January 2020. We consider minimization of indefinite quadratics with either trust-region (norm) constraints or cubic regularization. Despite the nonconvexity of these...
By Anne Greenbaum, Ren-Cang Li, and Michael L. OvertonSIAM Review, Volume 62, Issue 2, Page 463-482, January 2020. We present first-order perturbation analysis of a simple eigenvalue and the corresponding right and left eigenvectors of a general...
By Philipp Grohs, Sarah Koppensteiner, and Martin RathmairSIAM Review, Volume 62, Issue 2, Page 301-350, January 2020. The problem of phase retrieval, i.e., the problem of recovering a function from the magnitudes of its Fourier...
By Michael T. Schaub, Austin R. Benson, Paul Horn, Gabor Lippner, and Ali JadbabaieSIAM Review, Volume 62, Issue 2, Page 353-391, January 2020. Using graphs to model pairwise relationships between entities is a ubiquitous framework for studying complex systems and data. Simplicial...
By Volker H. SchulzSIAM Review, Volume 62, Issue 2, Page 511-526, January 2020. I am writing these lines in April 2020 while science is in lockdown mode globally. They will be published...
By The EditorsSIAM Review, Volume 62, Issue 2, Page 393-393, January 2020. The SIGEST article in this issue, “First-Order Methods for Nonconvex Quadratic Minimization,” by Yair Carmon and John C. Duchi,...
By Misha E. KilmerSIAM Review, Volume 62, Issue 2, Page 351-351, January 2020. The current issue of SIAM Review features the Research Spotlights article “Random Walks on Simplicial Complexes and the Normalized...
By Darinka DentchevaSIAM Review, Volume 62, Issue 2, Page 437-438, January 2020. The Education section of SIAM Review presents three papers in this issue. In the first paper Lloyd N. Trefethen...
By J. M. Sanz-SernaSIAM Review, Volume 62, Issue 2, Page 299-299, January 2020. In a previous issue of SIAM Review, I started my introduction to the Survey and Review section by saying...
By Aris Daniilidis and Dmitriy DrusvyatskiySIAM Journal on Optimization, Volume 30, Issue 2, Page 1327-1338, January 2020. We construct examples of Lipschitz continuous functions, with pathological subgradient dynamics in both continuous and discrete time....
By Serena Crisci, Federica Porta, Valeria Ruggiero, and Luca ZanniSIAM Journal on Optimization, Volume 30, Issue 2, Page 1300-1326, January 2020. In 1988, Barzilai and Borwein published a pioneering paper which opened the way to inexpensively accelerate first-order....
By Sunyoung Kim, Masakazu Kojima, and Kim-Chuan TohSIAM Journal on Optimization, Volume 30, Issue 2, Page 1251-1273, January 2020. We present a unified geometrical analysis on the completely positive programming (CPP) reformulations of quadratic optimization problems...
By Minglu Ye and Ting Kei PongSIAM Journal on Optimization, Volume 30, Issue 2, Page 1274-1299, January 2020. We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets...
By Jinlong Lei, Peng Yi, Guodong Shi, and Brian D. O. AndersonSIAM Journal on Optimization, Volume 30, Issue 2, Page 1191-1222, January 2020. In this paper, we study network linear equations subject to digital communications with a finite data rate,...
By Vincent Leclère, Pierre Carpentier, Jean-Philippe Chancelier, Arnaud Lenoir, and François PacaudSIAM Journal on Optimization, Volume 30, Issue 2, Page 1223-1250, January 2020. The stochastic dual dynamic programming (SDDP) algorithm has become one of the main tools used to address...
By Alberto Del Pia, Santanu S. Dey, and Robert WeismantelSIAM Journal on Optimization, Volume 30, Issue 2, Page 1173-1190, January 2020. In subset selection we search for the best linear predictor that involves a small subset of variables....
By Farzad Yousefian, Angelia Nedić, and Uday V. ShanbhagSIAM Journal on Optimization, Volume 30, Issue 2, Page 1144-1172, January 2020. Motivated by applications arising from large-scale optimization and machine learning, we consider stochastic quasi-Newton (SQN) methods for...
By Yingjie Bi and Ao TangSIAM Journal on Optimization, Volume 30, Issue 2, Page 1094-1118, January 2020. Based on concepts like the $k$th convex hull and finer characterization of nonconvexity of a function, we...
By Mishal Assif, Debasish Chatterjee, and Ravi BanavarSIAM Journal on Optimization, Volume 30, Issue 2, Page 1119-1143, January 2020. We treat the so-called scenario approach, a popular probabilistic approximation method for robust minmax optimization problems via...
By Philip E. Gill, Vyacheslav Kungurtsev, and Daniel P. RobinsonSIAM Journal on Optimization, Volume 30, Issue 2, Page 1067-1093, January 2020. In nonlinearly constrained optimization, penalty methods provide an effective strategy for handling equality constraints, while barrier methods...
By Javier Pen͂a and Vera RoshchinaSIAM Journal on Optimization, Volume 30, Issue 2, Page 1049-1066, January 2020. We offer a unified treatment of distinct measures of well-posedness for homogeneous conic systems. To ...
By Dorit S. Hochbaum and Cheng LuSIAM Journal on Optimization, Volume 30, Issue 1, Page 1048-1048, January 2020. On page 2568 of our paper A faster algorithm solving a generalization of isotonic median regression and...
By James SaundersonSIAM Journal on Optimization, Volume 30, Issue 1, Page 1033-1047, January 2020. A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a...
By Daniel PorumbelSIAM Journal on Optimization, Volume 30, Issue 1, Page 1007-1032, January 2020. Given a polytope $\mathcal P$, an interior point ${x}\in\mathcal P$, and a direction ${d}\in\mathbb{R}^n$, the projection of...
By Francisco J. Aragón Artacho and Phan T. VuongSIAM Journal on Optimization, Volume 30, Issue 1, Page 980-1006, January 2020. The boosted difference of convex functions algorithm (BDCA) was recently proposed for minimizing smooth difference of convex...
By Konstantin Mishchenko, Franck Iutzeler, and Jérôme MalickSIAM Journal on Optimization, Volume 30, Issue 1, Page 933-959, January 2020. We develop and analyze an asynchronous algorithm for distributed convex optimization when the objective can be written...
By Saeed Ghadimi, Andrzej Ruszczyński, and Mengdi WangSIAM Journal on Optimization, Volume 30, Issue 1, Page 960-979, January 2020. We study constrained nested stochastic optimization problems in which the objective function is a composition of two...
By Rujun Jiang and Duan LiSIAM Journal on Optimization, Volume 30, Issue 1, Page 915-932, January 2020. In this paper, we provide the first provable linear-time (in terms of the number of nonzero entries...
By S. Rasoul EtesamiSIAM Journal on Optimization, Volume 30, Issue 1, Page 885-914, January 2020. Motivated by emerging resource allocation and data placement problems such as web caches and peer-to-peer systems, we...
By Warren Hare and Gabriel Jarry-BolducSIAM Journal on Optimization, Volume 30, Issue 1, Page 853-884, January 2020. Simplex gradients, essentially the gradient of a linear approximation, are a popular tool in derivative-free...
By Junyi Liu and Suvrajeet SenSIAM Journal on Optimization, Volume 30, Issue 1, Page 823-852, January 2020. This paper presents the stochastic decomposition (SD) algorithms for two classes of stochastic programming problems: (1) two-stage...
By Xiaoyi Gu, Shabbir Ahmed, and Santanu S. DeySIAM Journal on Optimization, Volume 30, Issue 1, Page 781-797, January 2020. Mixed integer quadratic programming (MIQP) is the problem of minimizing a quadratic function over mixed integer points...
By Monaldo MastrolilliSIAM Journal on Optimization, Volume 30, Issue 1, Page 798-822, January 2020. Chvátal--Gomory cuts (CG-cuts) and the Bienstock--Zuckerberg hierarchy capture useful linear programs that the standard bounded degree...
By Zhengyuan Zhou, Panayotis Mertikopoulos, Nicholas Bambos, Stephen P. Boyd, and Peter W. GlynnSIAM Journal on Optimization, Volume 30, Issue 1, Page 687-716, January 2020. In this paper, we examine the convergence of mirror descent in a class of stochastic optimization problems...
By Necdet Serhat Aybat, Alireza Fallah, Mert Gürbüzbalaban, and Asuman OzdaglarSIAM Journal on Optimization, Volume 30, Issue 1, Page 717-751, January 2020. We study the trade-offs between convergence rate and robustness to gradient errors in designing a first-order algorithm....
By Johannes O. RoysetSIAM Journal on Optimization, Volume 30, Issue 1, Page 752-780, January 2020. Stability and error analysis remain challenging for problems that lack regularity properties near solutions, are subject to...
By Xiao Li, Zhihui Zhu, Anthony Man-Cho So, and René VidalSIAM Journal on Optimization, Volume 30, Issue 1, Page 660-686, January 2020. In this paper, we study the problem of recovering a low-rank matrix from a number of random...
By D. Russell Luke and Anna-Lena MartinsSIAM Journal on Optimization, Volume 30, Issue 1, Page 542-584, January 2020. Motivated by nonconvex, inconsistent feasibility problems in imaging, the relaxed alternating averaged reflections algorithm, or relaxed Douglas--Rachford...
By Aram V. Arutyunov and Alexey F. IzmailovSIAM Journal on Optimization, Volume 30, Issue 1, Page 604-629, January 2020. We study stability properties of a given solution of a constrained equation, where the constraint has the...
By Eduardo Casas and Mariano MateosSIAM Journal on Optimization, Volume 30, Issue 1, Page 585-603, January 2020. In this paper, we analyze optimal control problems governed by semilinear parabolic equations. Box constraints for the...
By Coralia Cartis, Nicholas I. M. Gould, and Philippe L. TointSIAM Journal on Optimization, Volume 30, Issue 1, Page 513-541, January 2020. We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e., problems...
By Chao Ding, Defeng Sun, Jie Sun, and Kim-Chuan TohSIAM Journal on Optimization, Volume 30, Issue 1, Page 630-659, January 2020. Spectral operators of matrices proposed recently in [C. Ding, D. F. Sun, J. Sun, and K. C....
By Volker H. SchulzSIAM Review, Volume 62, Issue 1, Page 283-297, January 2020. The frame for the Book Reviews section this time is formed by the books of two very well known...
By The EditorsSIAM Review, Volume 62, Issue 1, Page 197-197, January 2020. The SIGEST article in this issue, “Asymptotically Compatible Schemes for Robust Discretization of Parametrized Problems with Applications to Nonlocal...
By Misha E. KilmerSIAM Review, Volume 62, Issue 1, Page 131-131, January 2020. Tensors, or multiway arrays, are often used for storage of high-dimensional data. In order to have compression, completion,...
By J. M. Sanz-SernaSIAM Review, Volume 62, Issue 1, Page 1-1, January 2020. Bernard Brogliato and Aneel Tanwani are the authors of “Dynamical Systems Coupled with Monotone Set-Valued Operators: Formalisms, Applications, Well-Posedness,...
By Darinka DentchevaSIAM Review, Volume 62, Issue 1, Page 229-230, January 2020. The Education section of SIAM Review presents three papers in this issue. In the first paper Robert M. Corless...
By Xiaochuan Tian and Qiang DuSIAM Review, Volume 62, Issue 1, Page 199-227, January 2020. Many problems in nature, being characterized by a parameter, are of interest both with a fixed parameter value...
By Bernard Brogliato and Aneel TanwaniSIAM Review, Volume 62, Issue 1, Page 3-129, January 2020. This survey article addresses the class of continuous-time systems where a system modeled by ordinary differential equations is...
By David Hong, Tamara G. Kolda, and Jed A. DuerschSIAM Review, Volume 62, Issue 1, Page 133-163, January 2020. Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor...
By Tracy L. Stepien, Eric J. Kostelich, and Yang KuangSIAM Review, Volume 62, Issue 1, Page 244-263, January 2020. Most undergraduates have limited experience with mathematical modeling. In an effort to respond to various initiatives, such as the...
By Antônio Francisco NetoSIAM Review, Volume 62, Issue 1, Page 264-280, January 2020. In this work we introduce a new operator based approach to matrix analysis. Our main technical tool comprises an...
By Nawaf Bou-Rabee and Miranda C. Holmes-CerfonSIAM Review, Volume 62, Issue 1, Page 164-195, January 2020. Sticky Brownian motion is the simplest example of a diffusion process that can spend finite time both in the...
By Robert M. Corless and Leili Rafiee SevyeriSIAM Review, Volume 62, Issue 1, Page 231-243, January 2020. We look at two classical examples in the theory of numerical analysis, namely, the Runge example for interpolation and...
By Courtney Paquette and Katya ScheinbergSIAM Journal on Optimization, Volume 30, Issue 1, Page 349-376, January 2020. For deterministic optimization, line search methods augment algorithms by providing stability and improved efficiency. Here we adapt...
By A. Jourani and F. J. SilvaSIAM Journal on Optimization, Volume 30, Issue 1, Page 319-348, January 2020. The main objective of this work is to study the existence of Lagrange multipliers for infinite dimensional...
By Vincent GuiguesSIAM Journal on Optimization, Volume 30, Issue 1, Page 407-438, January 2020. We introduce an extension of stochastic dual dynamic programming (SDDP) to solve stochastic convex dynamic programming...
By Michel De Lara and Olivier GossnerSIAM Journal on Optimization, Volume 30, Issue 1, Page 464-489, January 2020. In decision problems under incomplete information, actions (identified to payoff vectors indexed by states of nature) and...
By Armin Eftekhari and Raphael A. HauserSIAM Journal on Optimization, Volume 30, Issue 1, Page 439-463, January 2020. Principal component analysis (PCA) finds the best linear representation of data and is an indispensable tool in...
By Johanna Burtscheidt, Matthias Claus, and Stephan DempeSIAM Journal on Optimization, Volume 30, Issue 1, Page 377-406, January 2020. We consider a two-stage stochastic bilevel linear program where the leader contemplates the follower's reaction at the...
By Xi Yin ZhengSIAM Journal on Optimization, Volume 30, Issue 1, Page 490-512, January 2020. Given a closed convex set A in a Banach space X, this paper considers the continuity and...
By Constantin ChristofSIAM Journal on Optimization, Volume 30, Issue 1, Page 290-318, January 2020. The aim of this paper is to explore a peculiar regularization effect that occurs in the sensitivity...
By Igor Klep and Jiawang NieSIAM Journal on Optimization, Volume 30, Issue 1, Page 240-261, January 2020. Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult...
By Vincent Roulet and Alexandre d'AspremontSIAM Journal on Optimization, Volume 30, Issue 1, Page 262-289, January 2020. The Łojasiewicz inequality shows that sharpness bounds on the minimum of convex optimization problems hold almost generically....
By Yuchen Xie, Richard H. Byrd, and Jorge NocedalSIAM Journal on Optimization, Volume 30, Issue 1, Page 182-209, January 2020. The classical convergence analysis of quasi-Newton methods assumes that function and gradient evaluations are exact. In this...
By Shixiang Chen, Shiqian Ma, Anthony Man-Cho So, and Tong ZhangSIAM Journal on Optimization, Volume 30, Issue 1, Page 210-239, January 2020. We consider optimization problems over the Stiefel manifold whose objective function is the summation of a smooth...
By Andreas Themelis and Panagiotis PatrinosSIAM Journal on Optimization, Volume 30, Issue 1, Page 149-181, January 2020. Although originally designed and analyzed for convex problems, the alternating direction method of multipliers (ADMM) and its...
By Xiao-Xiao Ma, Meng-Meng Zheng, and Zheng-Hai HuangSIAM Journal on Optimization, Volume 30, Issue 1, Page 132-148, January 2020. Recently, Gowda and Sossa studied weakly homogeneous variational inequalities (VIs), which contain the polynomial complementarity problem (PCP)...
By Sebastian Banert, Axel Ringh, Jonas Adler, Johan Karlsson, and Ozan ÖktemSIAM Journal on Optimization, Volume 30, Issue 1, Page 102-131, January 2020. In this work, we consider methods for solving large-scale optimization problems with a possibly nonsmooth objective function....
By Chao Zhang and Xiaojun ChenSIAM Journal on Optimization, Volume 30, Issue 1, Page 1-30, January 2020. We propose a novel smoothing active set method for linearly constrained non-Lipschitz nonconvex problems. At each step...
By Luís Felipe Bueno and José Mario MartínezSIAM Journal on Optimization, Volume 30, Issue 1, Page 80-101, January 2020. Recent papers indicate that some algorithms for constrained optimization may exhibit worst-case complexity bounds that are...
By Amir Beck and Nadav HallakSIAM Journal on Optimization, Volume 30, Issue 1, Page 56-79, January 2020. This paper studies the class of nonsmooth nonconvex problems in which the difference between a continuously...
By Yun-Bin ZhaoSIAM Journal on Optimization, Volume 30, Issue 1, Page 31-55, January 2020. The simulations indicate that the existing hard thresholding technique independent of the residual function may cause a...
By Vikrant Vaze The ongoing COVID-19 pandemic has had severe debilitating effects on the travel industry, with air transportation in particular feeling the pandemic’s onslaught. After a ...
By Pavel L. Krapivsky and Sidney Redner When arriving at a popular destination, where should you park your car? Distant parking spots are typically plentiful, but then you must walk a long ...
Update 7/14/20: Today, the Trump Administration rescinded these proposed rules on foreign students studying online, returning to the previous status quo. Thank you to all of the SIAM members who ...
We may not be able to meet in Toronto for this year’s Joint SIAM/CAIMS Annual Meeting (AN20) , but that doesn’t mean we can’t hold the meeting! SIAM and CAIMS are pivoting to virtual with a ...
The SIAM Student Paper Prize is awarded annually to the student author(s) of the most outstanding paper(s) accepted by SIAM journals within the three years preceding the nomination deadline. Starting with the 2018 award, the focus of the prize is to recognize outstanding scholarship by students in SIAM journals.
The Pioneer Prize is awarded every four years at the International Council for Industrial and Applied Mathematics (ICIAM) Congress to one individual for pioneering work introducing applied mathematical methods and scientific computing techniques to an industrial problem area or a new scientific field of applications. Nominations can be submitted via the ICIAM website.
The prize recognizes innovative software in scientific computing by researchers in the earlier stages of their career. Starting in 2019, SIAM will award the prize every four years at the SIAM Conference on Computational Science and Engineering.
Through the generosity and inspiration of Gerald and Judith Porter, the Mathematical Association of America (MAA), American Mathematical Society (AMS), and SIAM offer this annual lecture at the Joint Mathematics Meetings. The lecture, first awarded in 2010, is given on a mathematical topic accessible to the broader community.
Named in honor of I. E. Block, a co-founder and the first managing director of SIAM, this lecture is open to the public at the SIAM Annual Meeting. It is intended to encourage public appreciation of applied mathematics and computational science by reaching out to the local community.
Established in 1979 in honor of James H. Wilkinson, the prize is awarded to an individual in their early career for recent contributions to numerical analysis and scientific computing.
Established in 1959, the prize honors John von Neumann, a founder of modern computing. The prize is awarded annually for distinguished contributions to applied mathematics and for the effective communication of these ideas to the community.
The JPBM Communications Award is given annually to reward and encourage communicators who, on a sustained basis, bring mathematical ideas and information to non-mathematical audiences. The prize may be awarded in two categories: For Public Outreach and For Expository and Popular Books. Nominations can be submitted via the AMS website.
~*Learn More*~
The prize was established in 1986 in memory of Richard C. DiPrima, who served SIAM for many years and in 1979–1980 as SIAM President. It aims to recognize an early career researcher in applied mathematics and is based on the doctoral dissertation.
Established in 1992, this prize is awarded to the author or authors of the most outstanding paper, as determined by the selection committee, on a topic in optimization.
Established in 2018, the prize is awarded every three years to an individual in their early career for outstanding, influential, and potentially long-lasting contributions to the field of optimization.
The prize recognizes students for outstanding solutions to real world math problems. It is awarded to two of the teams judged "Outstanding" in the Mathematical Contest in Modeling (MCM) administered annually by the Consortium for Mathematics and Its Applications (COMAP). Registration is accepted via the COMAP website.
The SIAM Outstanding Paper Prize is not currently active. For the 20 years before it was discontinued in 2019, the SIAM Outstanding Paper Prizes brought attention to papers published in SIAM journals. Three awards were made each year to the authors of papers deemed by SIAM journal editors-in-chief worthy of particular attention.
The prize, established in 1985 and originally intended to be awarded periodically, is now awarded annually for contributions to the advancement of applied mathematics on the national or international level.
Looking for financial support to further your research? Fellowships often provide funding plus experiential learning opportunities to young researchers. Learn more about fellowship opportunities.
Read More
Internships allow you to network and forge connections for future job possibilities, while also exploring possible areas of interest. Look at this list of companies who offer valuable opportunities.
Our community is founded on igniting groundbreaking developments in applied math and computational science. Take a deeper dive into your area of study with one of these opportunities.