• 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 36 matches

• 2024
• 
  Yannis Bekri, Anatoli B. Juditsky, Arkadi Nemirovski:
  First order algorithms for computing linear and polyhedral estimates. Open J. Math. Optim. 5: 1-15 (2024)
• 
  Zhenan Fan, Huang Fang, Michael P. Friedlander:
  Cardinality-constrained structured data-fitting problems. Open J. Math. Optim. 5: 1-21 (2024)
• 
  Baptiste Goujaud, Adrien B. Taylor, Aymeric Dieuleveut:
  Short Paper - Quadratic minimization: from conjugate gradient to an adaptive Polyak's momentum method with Polyak step-sizes. Open J. Math. Optim. 5: 1-10 (2024)
• 
  Nicholas J. A. Harvey, Chris Liaw, Sikander Randhawa:
  Tight analyses for subgradient descent I: Lower bounds. Open J. Math. Optim. 5: 1-17 (2024)
• 
  Felix Hennings, Kai Hoppmann-Baum, Janina Zittel:
  Optimizing transient gas network control for challenging real-world instances using MIP-based heuristics. Open J. Math. Optim. 5: 1-34 (2024)
• 
  Alberto De Marchi, Andreas Themelis:
  An interior proximal gradient method for nonconvex optimization. Open J. Math. Optim. 5: 1-22 (2024)
• 
  Jérémy Omer, Michael Poss, Maxime Rougier:
  Combinatorial Robust Optimization with Decision-Dependent Information Discovery and Polyhedral Uncertainty. Open J. Math. Optim. 5: 1-25 (2024)
• 
  Vincent Roulet, Siddhartha S. Srinivasa, Maryam Fazel, Zaïd Harchaoui:
  Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates. Open J. Math. Optim. 5: 1-63 (2024)
• 
  Matthias Walter:
  Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions. Open J. Math. Optim. 5: 1-12 (2024)
• 2023
• 
  Jérôme Bolte, Lilian Glaudin, Edouard Pauwels, Mathieu Serrurier:
  The backtrack Hölder gradient method with application to min-max and min-min problems. Open J. Math. Optim. 4: 1-17 (2023)
• 
  Sonia Cafieri, Andrew R. Conn, Marcel Mongeau:
  The continuous quadrant penalty formulation of logical constraints. Open J. Math. Optim. 4: 1-12 (2023)
• 
  Olivier Fercoq:
  Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient. Open J. Math. Optim. 4: 1-34 (2023)
• 
  Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan:
  Cycle-based formulations in Distance Geometry. Open J. Math. Optim. 4: 1-16 (2023)
• 
  Welington de Oliveira:
  Short Paper - A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems. Open J. Math. Optim. 4: 1-10 (2023)
• 
  Ernesto Oré, Philippe Mahey, Eladio Ocaña:
  Inertial-relaxed splitting for composite monotone inclusions. Open J. Math. Optim. 4: 1-20 (2023)
• 
  Mark Turner, Thorsten Koch, Felipe Serrano, Michael Winkler:
  Adaptive Cut Selection in Mixed-Integer Linear Programming. Open J. Math. Optim. 4: 1-28 (2023)
• 
  Hande Yaman:
  Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty. Open J. Math. Optim. 4: 1-7 (2023)
• 2022
• 
  Mathieu Barré, Adrien B. Taylor, Francis R. Bach:
  A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives. Open J. Math. Optim. 3: 1-15 (2022)
• 
  Lénaïc Chizat:
  Convergence Rates of Gradient Methods for Convex Optimization in the Space of Measures. Open J. Math. Optim. 3: 1-19 (2022)
• 
  Robert Hildebrand, Matthias Köppe, Yuan Zhou:
  Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations. Open J. Math. Optim. 3: 1-44 (2022)
• 
  Anatoli B. Juditsky, Georgios Kotsalis, Arkadi Nemirovski:
  Tight computationally efficient approximation of matrix norms with applications. Open J. Math. Optim. 3: 1-38 (2022)
• 
  Antoine Oustry:
  AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization. Open J. Math. Optim. 3: 1-19 (2022)
• 
  Hamed Rahimian, Sanjay Mehrotra:
  Frameworks and Results in Distributionally Robust Optimization. Open J. Math. Optim. 3: 1-85 (2022)
• 
  Yifan Sun, Francis R. Bach:
  Screening for a Reweighted Penalized Conditional Gradient Method. Open J. Math. Optim. 3: 1-35 (2022)
• 
  Zhou Wei, Michel Théra, Jen-Chih Yao:
  Characterizations of Stability of Error Bounds for Convex Inequality Constraint Systems. Open J. Math. Optim. 3: 1-17 (2022)
• 2021
• 
  Edvin Åblad, Ann-Brith Strömberg, Domenico Spensieri:
  Exact makespan minimization of unrelated parallel machines. Open J. Math. Optim. 2: 1-15 (2021)
• 
  Wim van Ackooij, Pedro Pérez-Aros:
  Gradient formulae for probability functions depending on a heterogenous family of constraints. Open J. Math. Optim. 2: 1-29 (2021)
• 
  Salihah Alwadani, Heinz H. Bauschke, Julian P. Revalski, Xianfu Wang:
  The difference vectors for convex sets and a resolution of the geometry conjecture. Open J. Math. Optim. 2: 1-18 (2021)
• 
  Marcia Fampa, Jon Lee, Gabriel Ponte:
  Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. Open J. Math. Optim. 2: 1-14 (2021)
• 
  Marc Goerigk, Stefan Lendl:
  Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. 2: 1-18 (2021)

skipping 6 more matches