default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCédric Josz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Cédric Josz
, Lexiao Lai:
Global stability of first-order methods for coercive tame functions. Math. Program. 207(1): 551-576 (2024)- [j14]Cédric Josz, Lexiao Lai:
Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size. SIAM J. Optim. 34(1): 57-70 (2024) - 2023
- [j13]Cédric Josz:
Global convergence of the gradient method for functions definable in o-minimal structures. Math. Program. 202(1): 355-383 (2023) - [j12]Cédric Josz:
Correction: Global convergence of the gradient method for functions definable in o-minimal structures. Math. Program. 202(1): 385 (2023) - [j11]Cédric Josz, Lexiao Lai:
Lyapunov stability of the subgradient method with constant step size. Math. Program. 202(1): 387-396 (2023) - [j10]Cédric Josz, Lexiao Lai:
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size. Math. Program. 202(1): 397-398 (2023) - [j9]Cédric Josz, Xiaopeng Li:
Certifying the Absence of Spurious Local Minima at Infinity. SIAM J. Optim. 33(3): 1416-1439 (2023) - [j8]Cédric Josz, Lexiao Lai, Xiaopeng Li:
Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients. SIAM J. Optim. 33(4): 3012-3037 (2023) - [j7]Salar Fattahi, Cédric Josz, Yuhao Ding, Reza Mohammadi-Ghazi, Javad Lavaei, Somayeh Sojoudi:
On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization. IEEE Trans. Autom. Control. 68(1): 80-95 (2023) - 2022
- [j6]Cédric Josz, Lexiao Lai:
Nonsmooth rank-one matrix factorization landscape. Optim. Lett. 16(6): 1611-1631 (2022) - 2021
- [c9]Sikun Xu, Ruoyi Ma, Daniel K. Molzahn, Hassan L. Hijazi, Cédric Josz:
Verifying Global Optimality of Candidate Solutions to Polynomial Optimization Problems using a Determinant Relaxation Hierarchy. CDC 2021: 3143-3148 - 2020
- [j5]Fariba Zohrizadeh, Cédric Josz, Ming Jin, Ramtin Madani, Javad Lavaei, Somayeh Sojoudi:
A survey on conic relaxations of optimal power flow problem. Eur. J. Oper. Res. 287(2): 391-409 (2020) - [c8]Salar Fattahi, Cédric Josz, Reza Mohammadi-Ghazi, Javad Lavaei, Somayeh Sojoudi:
Absence of Spurious Local Trajectories in Time-Varying Optimization: A Control-Theoretic Perspective. CCTA 2020: 140-147
2010 – 2019
- 2019
- [j4]Cédric Josz, Jean-Bernard Lasserre, Bernard Mourrain:
Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? Adv. Comput. Math. 45(3): 1401-1437 (2019) - [j3]Richard Y. Zhang, Cédric Josz, Somayeh Sojoudi:
Conic optimization for control, energy systems, and machine learning: Applications and algorithms. Annu. Rev. Control. 47: 323-340 (2019) - [c7]Cédric Josz, Daniel K. Molzahn, Matteo Tacchi, Somayeh Sojoudi:
Transient Stability Analysis of Power Systems via Occupation Measures. ISGT 2019: 1-5 - [i2]Sogol Babaeinejadsarookolaee, Adam B. Birchfield, Richard D. Christie, Carleton Coffrin, Christopher L. DeMarco, Ruisheng Diao, Michael Ferris, Stephane Fliscounakis, Scott Greene, Renke Huang, Cédric Josz, Roman Korab, Bernard C. Lesieutre, Jean Maeght, Daniel K. Molzahn, Thomas J. Overbye, Patrick Panciatici, Byungkwon Park, Jonathan Snodgrass, Ray Zimmerman:
The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms. CoRR abs/1908.02788 (2019) - 2018
- [j2]Cédric Josz, Daniel K. Molzahn:
Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables. SIAM J. Optim. 28(2): 1017-1048 (2018) - [c6]Richard Y. Zhang, Cédric Josz, Somayeh Sojoudi:
Conic Optimization Theory: Convexification Techniques and Numerical Algorithms. ACC 2018: 798-815 - [c5]Cédric Josz, Yi Ouyang, Richard Y. Zhang, Javad Lavaei, Somayeh Sojoudi:
A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization. NeurIPS 2018: 2446-2454 - [c4]Richard Y. Zhang, Cédric Josz, Somayeh Sojoudi, Javad Lavaei:
How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? NeurIPS 2018: 5591-5602 - [i1]Richard Y. Zhang, Cédric Josz, Somayeh Sojoudi, Javad Lavaei:
How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery? CoRR abs/1805.10251 (2018) - 2016
- [j1]Cédric Josz, Didier Henrion:
Strong duality in Lasserre's hierarchy for polynomial optimization. Optim. Lett. 10(1): 3-10 (2016) - [c3]Daniel K. Molzahn, Cédric Josz, Ian A. Hiskens:
Moment relaxations of optimal power flow problems: Beyond the convex hull. GlobalSIP 2016: 856-860 - [c2]Daniel K. Molzahn, Ian A. Hiskens, Cédric Josz, Patrick Panciatici:
Computational analysis of sparsity-exploiting moment relaxations of the OPF problem. PSCC 2016: 1-7 - 2015
- [c1]Daniel K. Molzahn, Cédric Josz, Ian A. Hiskens, Patrick Panciatici:
Solution of optimal power flow problems using moment relaxations augmented with objective function penalization. CDC 2015: 31-38
Coauthor Index
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.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
