• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 128 matches

• 2020
• 
  Samir Adly, Hédy Attouch:
  Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping. SIAM J. Optim. 30(3): 2134-2162 (2020)
• 
  Mehiddin Al-Baali, Andrea Caliciotti, Giovanni Fasano, Massimo Roma:
  A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization. SIAM J. Optim. 30(3): 1954-1979 (2020)
• 
  Francisco J. Aragón Artacho, Phan Tu Vuong:
  The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions. SIAM J. Optim. 30(1): 980-1006 (2020)
• 
  Aram V. Arutyunov, Alexey F. Izmailov:
  Covering on a Convex Set in the Absence of Robinson's Regularity. SIAM J. Optim. 30(1): 604-629 (2020)
• 
  Mishal Assif, Debasish Chatterjee, Ravi N. Banavar:
  Scenario Approach for Minmax Optimization with Emphasis on the Nonconvex Case: Positive Results and Caveats. SIAM J. Optim. 30(2): 1119-1143 (2020)
• 
  Hédy Attouch, Szilárd Csaba László:
  Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators. SIAM J. Optim. 30(4): 3252-3283 (2020)
• 
  Necdet Serhat Aybat, Alireza Fallah, Mert Gürbüzbalaban, Asuman E. Ozdaglar:
  Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions. SIAM J. Optim. 30(1): 717-751 (2020)
• 
  Sebastian Banert, Axel Ringh, Jonas Adler, Johan Karlsson, Ozan Öktem:
  Data-Driven Nonsmooth Optimization. SIAM J. Optim. 30(1): 102-131 (2020)
• 
  Federico Bassetti, Stefano Gualandi, Marco Veneroni:
  On the Computation of Kantorovich-Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows. SIAM J. Optim. 30(3): 2441-2469 (2020)
• 
  Heinz H. Bauschke, Walaa M. Moursi:
  On the Behavior of the Douglas-Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint. SIAM J. Optim. 30(3): 2559-2576 (2020)
• 
  Olivier Beaude, Pascal Benchimol, Stéphane Gaubert, Paulin Jacquot, Nadia Oudjane:
  A Privacy-Preserving Method to Optimize Distributed Resource Allocation. SIAM J. Optim. 30(3): 2303-2336 (2020)
• 
  Amir Beck, Nadav Hallak:
  On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods. SIAM J. Optim. 30(1): 56-79 (2020)
• 
  El Houcine Bergou, Eduard Gorbunov, Peter Richtárik:
  Stochastic Three Points Method for Unconstrained Smooth Minimization. SIAM J. Optim. 30(4): 2726-2749 (2020)
• 
  Yingjie Bi, Ao Tang:
  Duality Gap Estimation via a Refined Shapley-Folkman Lemma. SIAM J. Optim. 30(2): 1094-1118 (2020)
• 
  Immanuel M. Bomze, Francesco Rinaldi, Damiano Zeffiro:
  Active Set Complexity of the Away-Step Frank-Wolfe Algorithm. SIAM J. Optim. 30(3): 2470-2500 (2020)
• 
  Silvia Bonettini, Marco Prato, Simone Rebegoldi:
  Convergence of Inexact Forward-Backward Algorithms Using the Forward-Backward Envelope. SIAM J. Optim. 30(4): 3069-3097 (2020)
• 
  Eike Börgens, Christian Kanzow, Patrick Mehlitz, Gerd Wachsmuth:
  New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions. SIAM J. Optim. 30(4): 2956-2982 (2020)
• 
  Luis Felipe Bueno, José Mario Martínez:
  On the Complexity of an Inexact Restoration Method for Constrained Optimization. SIAM J. Optim. 30(1): 80-101 (2020)
• 
  James V. Burke, Frank E. Curtis, Hao Wang, Jiashan Wang:
  Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver. SIAM J. Optim. 30(3): 1822-1849 (2020)
• 
  Johanna Burtscheidt, Matthias Claus, Stephan Dempe:
  Risk-Averse Models in Bilevel Stochastic Linear Programming. SIAM J. Optim. 30(1): 377-406 (2020)
• 
  Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
  Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. 30(1): 513-541 (2020)
• 
  Francesco Caruso, Maria Carmela Ceparano, Jacqueline Morgan:
  An Inverse-Adjusted Best Response Algorithm for Nash Equilibria. SIAM J. Optim. 30(2): 1638-1663 (2020)
• 
  Eduardo Casas, Mariano Mateos:
  Critical Cones for Sufficient Second Order Conditions in PDE Constrained Optimization. SIAM J. Optim. 30(1): 585-603 (2020)
• 
  Yuxin Chen, Yuejie Chi, Jianqing Fan, Cong Ma, Yuling Yan:
  Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization. SIAM J. Optim. 30(4): 3098-3121 (2020)
• 
  Shixiang Chen, Shiqian Ma, Anthony Man-Cho So, Tong Zhang:
  Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold. SIAM J. Optim. 30(1): 210-239 (2020)
• 
  J. Chen, X. Wang, Chayne Planiden:
  A Proximal Average for Prox-Bounded Functions. SIAM J. Optim. 30(2): 1366-1390 (2020)
• 
  Constantin Christof:
  Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level. SIAM J. Optim. 30(1): 290-318 (2020)
• 
  Constantin Christof, Juan Carlos de los Reyes, Christian Meyer:
  A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities. SIAM J. Optim. 30(3): 2163-2196 (2020)
• 
  Thai Doan Chuong:
  Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty. SIAM J. Optim. 30(2): 1501-1526 (2020)
• 
  Serena Crisci, Federica Porta, Valeria Ruggiero, Luca Zanni:
  Spectral Properties of Barzilai-Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds. SIAM J. Optim. 30(2): 1300-1326 (2020)

skipping 98 more matches