Остановите войну!
for scientists:
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 119 matches
- 2023
- Max L. N. Gonçalves, Tiago C. Menezes:
A framework for convex-constrained monotone nonlinear equations and its special cases. Comput. Appl. Math. 42(7): 306 (2023) - Marc Dambrine, Helmut Harbrecht, Bénédicte Puig:
Bernoulli Free Boundary Problems Under Uncertainty: The Convex Case. Comput. Methods Appl. Math. 23(2): 333-352 (2023) - Rui Chen, Sanjeeb Dash, Oktay Günlük:
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50: 100804 (2023) - Danielle Bednarski, Jan Lellmann:
Inverse Scale Space Iterations for Non-Convex Variational Problems: The Continuous and Discrete Case. J. Math. Imaging Vis. 65(1): 124-139 (2023) - Andrew Lowy, Meisam Razaviyayn:
Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses. ALT 2023: 986-1054 - Yassine Kamri, Julien M. Hendrickx, François Glineur:
On the Worst-Case Analysis of Cyclic Coordinate-Wise Algorithms on Smooth Convex Functions. ECC 2023: 1-8 - Taihei Oki, Shinsaku Sakaue:
Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case. NeurIPS 2023 - Tim Johnston, Iosif Lytras, Sotirios Sabanis:
Kinetic Langevin MCMC Sampling Without Gradient Lipschitz Continuity - the Strongly Convex Case. CoRR abs/2301.08039 (2023) - Taihei Oki, Shinsaku Sakaue:
Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case. CoRR abs/2306.05865 (2023) - Meixuan He, Yuqing Liang, Jinlan Liu, Dongpo Xu:
Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case. CoRR abs/2307.11782 (2023) - 2022
- Ren-Jiang Zhang:
The four-point interpolation subdivision curve is neither convex nor concave in all but one case. Comput. Aided Geom. Des. 93: 102073 (2022) - Samira Rouhani, Saman Hassanzadeh Amin:
A robust convex optimization approach to design a hierarchical organ transplant network: A case study. Expert Syst. Appl. 197: 116716 (2022) - Pawel Jan Kalczynski, Zvi Drezner:
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location. Optim. Lett. 16(4): 1153-1166 (2022) - Francisco Facchinei, Vyacheslav Kungurtsev, Lorenzo Lampariello, Gesualdo Scutari:
Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case. Optim. Methods Softw. 37(4): 1242-1268 (2022) - Arman Adibi, Aryan Mokhtari, Hamed Hassani:
Minimax Optimization: The Case of Convex-Submodular. AISTATS 2022: 3556-3580 - Naganand Yadati:
A Convex Formulation for Graph Convolutional Training: Two Layer Case. ICDM 2022: 1281-1286 - Leonardo Cunha, Gauthier Gidel, Fabian Pedregosa, Damien Scieur, Courtney Paquette:
Only tails matter: Average-Case Universality and Robustness in the Convex Regime. ICML 2022: 4474-4491 - Danielle Bednarski, Jan Lellmann:
Inverse Scale Space Iterations for Non-Convex Variational Problems: The Continuous and Discrete Case. CoRR abs/2203.10865 (2022) - E. Zhixuan Zeng, Adrian Florea, Alexander Wong:
COVID-Net US-X: Enhanced Deep Neural Network for Detection of COVID-19 Patient Cases from Convex Ultrasound Imaging Through Extended Linear-Convex Ultrasound Augmentation Learning. CoRR abs/2204.13851 (2022) - Leonardo Cunha, Gauthier Gidel, Fabian Pedregosa, Damien Scieur, Courtney Paquette:
Only Tails Matter: Average-Case Universality and Robustness in the Convex Regime. CoRR abs/2206.09901 (2022) - 2021
- Frauke Liers, Alexander Martin, Maximilian Merkert, Nick Mertens, Dennis Michaels:
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. J. Glob. Optim. 80(2): 307-340 (2021) - Ben Kretzu, Dan Garber:
Revisiting Projection-free Online Learning: the Strongly Convex Case. AISTATS 2021: 3592-3600 - Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda:
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. CALDAM 2021: 179-195 - Sarath Sivaprasad, Ankur Singh, Naresh Manwani, Vineet Gandhi:
The Curious Case of Convex Neural Networks. ECML/PKDD (1) 2021: 738-754 - WenYi Tian, Xiaoming Yuan, Hangrui Yue:
An ADMM-Newton-CNN Numerical Approach to a TV Model for Identifying Discontinuous Diffusion Coefficients in Elliptic Equations: Convex Case with Gradient Observations. CoRR abs/2103.11176 (2021) - Arman Adibi, Aryan Mokhtari, Hamed Hassani:
Minimax Optimization: The Case of Convex-Submodular. CoRR abs/2111.01262 (2021) - 2020
- Elizabeth Glista, Somayeh Sojoudi:
Convex model to evaluate worst-case performance of local search in the Optimal Power Flow problem. CDC 2020: 1691-1697 - Martin Gulan, Ngoc Anh Nguyen, Gergely Takács:
Convex Lifting Based Inverse Parametric Optimization for Implicit Model Predictive Control: A Case Study. CDC 2020: 2501-2508 - Assaf Dauber, Meir Feder, Tomer Koren, Roi Livni:
Can Implicit Bias Explain Generalization? Stochastic Convex Optimization as a Case Study. NeurIPS 2020 - Assaf Dauber, Meir Feder, Tomer Koren, Roi Livni:
Can Implicit Bias Explain Generalization? Stochastic Convex Optimization as a Case Study. CoRR abs/2003.06152 (2020)
skipping 89 more matches
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-04-23 09:08 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