![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 18 matches
- 2019
- Yuxin Chen
, Yuejie Chi
, Jianqing Fan, Cong Ma
:
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval. Math. Program. 176(1-2): 5-37 (2019) - Yifan Chen
, Yuejiao Sun, Wotao Yin
:
Run-and-Inspect Method for nonconvex optimization and global optimality bounds for R-local minimizers. Math. Program. 176(1-2): 39-67 (2019) - Frank E. Curtis
, Daniel P. Robinson:
Exploiting negative curvature in deterministic and stochastic optimization. Math. Program. 176(1-2): 69-94 (2019) - Hongbo Dong
, Miju Ahn, Jong-Shi Pang:
Structural properties of affine sparsity constraints. Math. Program. 176(1-2): 95-135 (2019) - Carson Eisenach
, Han Liu:
Efficient, certifiably optimal clustering with applications to latent variable graphical models. Math. Program. 176(1-2): 137-173 (2019) - Ethan X. Fang, Han Liu, Mengdi Wang
:
Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach. Math. Program. 176(1-2): 175-205 (2019) - Davood Hajinezhad, Mingyi Hong
:
Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization. Math. Program. 176(1-2): 207-245 (2019) - Michael Ho, Jack Xin:
Sparse Kalman filtering approaches to realized covariance estimation from high frequency financial data. Math. Program. 176(1-2): 247-278 (2019) - Koulik Khamaru, Rahul Mazumder
:
Computation of the maximum likelihood estimator in low-rank factor analysis. Math. Program. 176(1-2): 279-310 (2019) - Jason D. Lee
, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I. Jordan
, Benjamin Recht:
First-order methods almost always avoid strict saddle points. Math. Program. 176(1-2): 311-337 (2019) - Tianxiang Liu, Ting Kei Pong
, Akiko Takeda:
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. 176(1-2): 339-367 (2019) - Yufeng Liu, Jong-Shi Pang, Jack Xin:
Preface. Math. Program. 176(1-2): 1-4 (2019) - Zhaosong Lu
, Zirui Zhou
, Zhe Sun:
Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176(1-2): 369-401 (2019) - Michael O'Neill
, Stephen J. Wright
:
Behavior of accelerated gradient methods near critical points of nonconvex functions. Math. Program. 176(1-2): 403-427 (2019) - Chengde Qian, Quoc Tran-Dinh, Sheng Fu, Changliang Zou, Yufeng Liu
:
Robust multicategory support matrix machines. Math. Program. 176(1-2): 429-463 (2019) - Meisam Razaviyayn, Mingyi Hong, Navid Reyhanian, Zhi-Quan Luo:
A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems. Math. Program. 176(1-2): 465-496 (2019) - Gesualdo Scutari
, Ying Sun:
Distributed nonconvex constrained optimization over time-varying digraphs. Math. Program. 176(1-2): 497-544 (2019) - Zhuoran Yang, Lin F. Yang, Ethan X. Fang, Tuo Zhao, Zhaoran Wang, Matey Neykov:
Misspecified nonconvex statistical optimization for sparse phase retrieval. Math. Program. 176(1-2): 545-571 (2019)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-21 00:56 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