


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.
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 26 matches
- 2022
- Samir Adly
, Hédy Attouch:
First-order inertial algorithms involving dry friction damping. Math. Program. 193(1): 405-445 (2022) - Hédy Attouch, Zaki Chbani, Jalal Fadili, Hassan Riahi:
First-order optimization algorithms via inertial systems with Hessian driven damping. Math. Program. 193(1): 113-155 (2022) - Boaz Barak, Ankur Moitra:
Noisy tensor completion via the sum-of-squares hierarchy. Math. Program. 193(2): 513-548 (2022) - Aditya Bhaskara, Aidao Chen, Aidan Perreault, Aravindan Vijayaraghavan
:
Smoothed analysis for tensor methods in unsupervised learning. Math. Program. 193(2): 549-599 (2022) - Grigoriy Blekherman
, Bharath Hebbe Madhusudhana
:
Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems. Math. Program. 193(2): 601-628 (2022) - Diego Cifuentes
, Sameer Agarwal, Pablo A. Parrilo
, Rekha R. Thomas:
On the local stability of semidefinite relaxations. Math. Program. 193(2): 629-663 (2022) - Aleksandar Cvetkovic
, Vladimir Yu. Protasov
:
The greedy strategy for optimizing the Perron eigenvalue. Math. Program. 193(1): 1-31 (2022) - Nikita Doikov
, Yurii E. Nesterov
:
Local convergence of tensor methods. Math. Program. 193(1): 315-336 (2022) - Abraham Frandsen
, Rong Ge:
Optimization landscape of Tucker decomposition. Math. Program. 193(2): 687-712 (2022) - Shmuel Friedland, Jean-Bernard Lasserre, Lek-Heng Lim, Jiawang Nie:
Special Issue: Polynomial and Tensor Optimization. Math. Program. 193(2): 511-512 (2022) - Rong Ge
, Tengyu Ma:
On the optimization landscape of tensor decompositions. Math. Program. 193(2): 713-759 (2022) - Y. Görkem Gökmen
, E. Alper Yildirim
:
On standard quadratic programs with exact and inexact doubly nonnegative relaxations. Math. Program. 193(1): 365-403 (2022) - Lê Tuân Hoa:
Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity. Math. Program. 193(1): 157-194 (2022) - Hark-Chin Hwang
:
Subcontracting and lot-sizing with constant capacities. Math. Program. 193(1): 271-314 (2022) - Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
:
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints. Math. Program. 193(2): 761-787 (2022) - Igor Klep, Victor Magron, Janez Povh
:
Sparse noncommutative polynomial optimization. Math. Program. 193(2): 789-829 (2022) - Etienne de Klerk
, Monique Laurent
:
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193(2): 665-685 (2022) - Drew P. Kouri
, Thomas M. Surowiec
:
A primal-dual algorithm for risk minimization. Math. Program. 193(1): 337-363 (2022) - Khazhgali Kozhasov
, Jean-Bernard Lasserre
:
Nonnegative forms with sublevel sets of minimal volume. Math. Program. 193(1): 485-498 (2022) - Puya Latafat
, Andreas Themelis
, Panagiotis Patrinos
:
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems. Math. Program. 193(1): 195-224 (2022) - Igor Molybog, Somayeh Sojoudi, Javad Lavaei
:
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing. Math. Program. 193(1): 75-111 (2022) - Nikitas Rontsis
, Paul J. Goulart
, Yuji Nakatsukasa:
An active-set algorithm for norm constrained quadratic problems. Math. Program. 193(1): 447-483 (2022) - Saverio Salzo
, Silvia Villa
:
Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis. Math. Program. 193(1): 225-269 (2022) - Lucas Slot
, Monique Laurent
:
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. Math. Program. 193(2): 831-871 (2022) - Alex L. Wang
, Fatma Kilinç-Karzan
:
On the tightness of SDP relaxations of QCQPs. Math. Program. 193(1): 33-73 (2022) - Chenyang Yuan
, Pablo A. Parrilo
:
Maximizing products of linear forms, and the permanent of positive semidefinite matrices. Math. Program. 193(1): 499-510 (2022)
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.
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.
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.
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 2025-06-29 18:10 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