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