default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2024
- Zhenan Fan, Huang Fang, Michael P. Friedlander:
Cardinality-constrained structured data-fitting problems. Open J. Math. Optim. 5: 1-21 (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) - 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) - Giacomo Nannicini:
On the implementation of a global optimization method for mixed-variable problems. Open J. Math. Optim. 2: 1-25 (2021) - Jérémy Omer, Antonio Mucherino:
The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods. Open J. Math. Optim. 2: 1-29 (2021) - Giovanni Righini:
Efficient optimization of the Held-Karp lower bound. Open J. Math. Optim. 2: 1-17 (2021) - Peng Zheng, Karthikeyan Natesan Ramamurthy, Aleksandr Y. Aravkin:
Estimating Shape Parameters of Piecewise Linear-Quadratic Problems. Open J. Math. Optim. 2: 1-18 (2021) - 2020
- Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Avery D. Winn:
Revisiting a Cutting-Plane Method for Perfect Matchings. Open J. Math. Optim. 1: 1-15 (2020) - Aviv Gibali, Shoham Sabach, Sergey Voldman:
Non-Convex Split Feasibility Problems: Models, Algorithms and Theory. Open J. Math. Optim. 1: 1-15 (2020)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-08 20:02 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint