On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraint (English)
- New search for: Zhang, Haixiang
- New search for: Milzarek, Andre
- New search for: Wen, Zaiwen
- Further information on Wen, Zaiwen:
- https://orcid.org/http://orcid.org/0000-0003-1762-0671
- New search for: Yin, Wotao
- New search for: Zhang, Haixiang
- New search for: Milzarek, Andre
- New search for: Wen, Zaiwen
- Further information on Wen, Zaiwen:
- https://orcid.org/http://orcid.org/0000-0003-1762-0671
- New search for: Yin, Wotao
In:
Mathematical Programming
: A Publication of the Mathematical Optimization Society
;
195
, 1-2
;
421-473
;
2022
- Article (Journal) / Electronic Resource
-
Title:On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraint
-
Additional title:Math. Program.
-
Contributors:Zhang, Haixiang ( author ) / Milzarek, Andre ( author ) / Wen, Zaiwen ( author ) / Yin, Wotao ( author )
-
Published in:Mathematical Programming : A Publication of the Mathematical Optimization Society ; 195, 1-2 ; 421-473
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin/Heidelberg
-
Publication date:2022-09-01
-
Size:53 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Classification:
-
Source:
Table of contents – Volume 195, Issue 1-2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Non-convex exact community recovery in stochastic block modelWang, Peng / Zhou, Zirui / So, Anthony Man-Cho et al. | 2021
- 1
-
A combinatorial algorithm for computing the rank of a generic partitioned matrix with $$2 \times 2$$ submatricesHirai, Hiroshi / Iwamasa, Yuni et al. | 2021
- 1
-
A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatricesHirai, Hiroshi / Iwamasa, Yuni et al. | 2022
- 39
-
Bootstrap robust prescriptive analyticsBertsimas, Dimitris / Van Parys, Bart et al. | 2021
- 79
-
Understanding the acceleration phenomenon via high-resolution differential equationsShi, Bin / Du, Simon S. / Jordan, Michael I. / Su, Weijie J. et al. | 2021
- 149
-
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problemHirai, Hiroshi / Ikeda, Motoki et al. | 2021
- 183
-
Fully polynomial time (Σ,Π)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programsHalman, Nir / Nannicini, Giacomo et al. | 2022
- 183
-
Fully polynomial time $$(\Sigma ,\Pi )$$-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programsHalman, Nir / Nannicini, Giacomo et al. | 2021
- 243
-
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPsErdogdu, Murat A. / Ozdaglar, Asuman / Parrilo, Pablo A. / Vanli, Nuri Denizcan et al. | 2021
- 283
-
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lensKılınç-Karzan, Fatma / Küçükyavuz, Simge / Lee, Dabeen et al. | 2021
- 327
-
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methodsLaiu, M. Paul / Tits, André L. et al. | 2021
- 367
-
Empowering the configuration-IP: new PTAS results for scheduling with setup timesJansen, Klaus / Klein, Kim-Manuel / Maack, Marten / Rau, Malin et al. | 2021
- 403
-
Integer plane multiflow maximisation: one-quarter-approximation and gapsGarg, Naveen / Kumar, Nikhil / Sebő, András et al. | 2021
- 421
-
On the geometric analysis of a quartic–quadratic optimization problem under a spherical constraintZhang, Haixiang / Milzarek, Andre / Wen, Zaiwen / Yin, Wotao et al. | 2021
- 475
-
Set characterizations and convex extensions for geometric convex-hull proofsBärmann, Andreas / Schneider, Oskar et al. | 2021
- 517
-
Worst-case analysis of clique MIPsNaderi, Mohammad Javad / Buchanan, Austin / Walteros, Jose L. et al. | 2021
- 553
-
Curiosities and counterexamples in smooth convex optimizationBolte, Jérôme / Pauwels, Edouard et al. | 2021
- 605
-
A tractable multi-leader multi-follower peak-load-pricing model with strategic interactionGrimm, Veronika / Nowak, Daniel / Schewe, Lars / Schmidt, Martin / Schwartz, Alexandra / Zöttl, Gregor et al. | 2021
- 649
-
Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimizationZhang, Junyu / Xiao, Lin et al. | 2021
- 693
-
Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functionsPatel, Vivak et al. | 2021
- 735
-
From differential equation solvers to accelerated first-order methods for convex optimizationLuo, Hao / Chen, Long et al. | 2021
- 783
-
On the complexity of finding a local minimizer of a quadratic function over a polytopeAhmadi, Amir Ali / Zhang, Jeffrey et al. | 2022
- 831
-
Discrete 2-convex functionsFujishige, Satoru / Tardella, Fabio et al. | 2021
- 855
-
Best approximation mappings in Hilbert spacesBauschke, Heinz H. / Ouyang, Hui / Wang, Xianfu et al. | 2021
- 903
-
A Lagrange–Newton algorithm for sparse nonlinear programmingZhao, Chen / Xiu, Naihua / Qi, Houduo / Luo, Ziyan et al. | 2021
- 929
-
A control-theoretic perspective on optimal high-order optimizationLin, Tianyi / Jordan, Michael I. et al. | 2021
- 977
-
Decreasing minimization on M-convex sets: background and structuresFrank, András / Murota, Kazuo et al. | 2021
- 1027
-
Decreasing minimization on M-convex sets: algorithms and applicationsFrank, András / Murota, Kazuo et al. | 2021
- 1069
-
Distributionally robust stochastic programs with side information based on trimmingsEsteban-Pérez, Adrián / Morales, Juan M. et al. | 2021
- 1107
-
On linear optimization over Wasserstein ballsYue, Man-Chung / Kuhn, Daniel / Wiesemann, Wolfram et al. | 2021
- 1123
-
Computing the nucleolus of weighted voting games in pseudo-polynomial timePashkovich, Kanstantsin et al. | 2021
- 1135
-
The aggregation closure is polyhedral for packing and covering integer programsPashkovich, Kanstantsin / Poirrier, Laurent / Pulyassary, Haripriya et al. | 2021