Vertex downgrading to minimize connectivity (Englisch)
- Neue Suche nach: Aissi, Hassene
- Neue Suche nach: Chen, Da Qi
- Weitere Informationen zu Chen, Da Qi:
- https://orcid.org/0000-0001-5976-4687
- Neue Suche nach: Ravi, R.
- Neue Suche nach: Aissi, Hassene
- Neue Suche nach: Chen, Da Qi
- Weitere Informationen zu Chen, Da Qi:
- https://orcid.org/0000-0001-5976-4687
- Neue Suche nach: Ravi, R.
In:
Mathematical Programming
;
199
, 1-2
; 215-249
;
2022
-
ISSN:
- Aufsatz (Zeitschrift) / Elektronische Ressource
-
Titel:Vertex downgrading to minimize connectivity
-
Beteiligte:
-
Erschienen in:Mathematical Programming ; 199, 1-2 ; 215-249
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
- Neue Suche nach: Springer
-
Erscheinungsort:Berlin
-
Erscheinungsdatum:2022
-
ISSN:
-
ZDBID:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Elektronische Ressource
-
Sprache:Englisch
- Neue Suche nach: 31.80
- Weitere Informationen zu Basisklassifikation
-
Schlagwörter:
-
Klassifikation:
BKL: 31.80 Angewandte Mathematik -
Datenquelle:
Inhaltsverzeichnis – Band 199, Ausgabe 1-2
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraintsOliveira, Roberto I. / Thompson, Philip et al. | 2022
- 49
-
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the LassoOliveira, Roberto I. / Thompson, Philip et al. | 2023
- 87
-
Linear convergence of Frank–Wolfe for rank-one matrix recovery without strong convexityGarber, Dan et al. | 2022
- 123
-
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrierZhao, Renbo / Freund, Robert M. et al. | 2022
- 165
-
Lower bounds for non-convex stochastic optimizationArjevani, Yossi / Carmon, Yair / Duchi, John C. / Foster, Dylan J. / Srebro, Nathan / Woodworth, Blake et al. | 2022
- 215
-
Vertex downgrading to minimize connectivityAissi, Hassene / Chen, Da Qi / Ravi, R. et al. | 2022
- 251
-
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraintsOkuno, Takayuki / Fukushima, Masao et al. | 2022
- 305
-
Subgradient ellipsoid method for nonsmooth convex problemsRodomanov, Anton / Nesterov, Yurii et al. | 2022
- 343
-
Optimal error bounds for non-expansive fixed-point iterations in normed spacesContreras, Juan Pablo / Cominetti, Roberto et al. | 2022
- 375
-
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programmingRockafellar, R. Tyrrell et al. | 2022
- 421
-
Solving sparse principal component analysis with global supportDey, Santanu S. / Molinaro, Marco / Wang, Guanyi et al. | 2022
- 461
-
Scalable subspace methods for derivative-free nonlinear least-squares optimizationCartis, Coralia / Roberts, Lindon et al. | 2022
- 525
-
Riemannian Optimization via Frank-Wolfe MethodsWeber, Melanie / Sra, Suvrit et al. | 2022
- 557
-
An optimal gradient method for smooth strongly convex minimizationTaylor, Adrien / Drori, Yoel et al. | 2022
- 595
-
Probability maximization via Minkowski functionals: convex representations and tractable resolutionBardakci, I. E. / Jalilzadeh, A. / Lagoa, C. / Shanbhag, U. V. et al. | 2022
- 639
-
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problemZhang, Zeyang / Gao, Chuanhou / Luedtke, James et al. | 2022
- 671
-
Disjunctive cuts in Mixed-Integer Conic OptimizationLodi, Andrea / Tanneau, Mathieu / Vielma, Juan-Pablo et al. | 2022
- 721
-
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangiansNa, Sen / Anitescu, Mihai / Kolar, Mladen et al. | 2022
- 793
-
Unifying mirror descent and dual averagingJuditsky, Anatoli / Kwon, Joon / Moulines, Éric et al. | 2022
- 831
-
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedyLevin, Eitan / Kileel, Joe / Boumal, Nicolas et al. | 2022
- 865
-
An exponential lower bound for Zadeh’s pivot ruleDisser, Yann / Friedmann, Oliver / Hopp, Alexander V. et al. | 2022
- 937
-
A convergence analysis of the price of anarchy in atomic congestion gamesWu, Zijun / Möhring, Rolf H. / Ren, Chunying / Xu, Dachuan et al. | 2022
- 995
-
Node connectivity augmentation via iterative randomized roundingAngelidakis, Haris / Hyatt-Denesik, Dylan / Sanità, Laura et al. | 2022
- 1033
-
Semi-discrete optimal transport: hardness, regularization and numerical solutionTaşkesen, Bahar / Shafieezadeh-Abadeh, Soroosh / Kuhn, Daniel et al. | 2022
- 1107
-
Polynomial-time algorithms for multimarginal optimal transport problems with structureAltschuler, Jason M. / Boix-Adserà, Enric et al. | 2022
- 1179
-
Zeroth-order optimization with orthogonal random directionsKozak, David / Molinari, Cesare / Rosasco, Lorenzo / Tenorio, Luis / Villa, Silvia et al. | 2022
- 1221
-
Exact computation of an error bound for the balanced linear complementarity problem with unique solutionDussault, Jean-Pierre / Gilbert, Jean Charles et al. | 2022
- 1239
-
Tangencies and polynomial optimizationPhạm, Tiến-Sơn et al. | 2022
- 1273
-
Towards explicit superlinear convergence rate for SR1Ye, Haishan / Lin, Dachao / Chang, Xiangyu / Zhang, Zhihua et al. | 2022
- 1305
-
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximationsHu, Shenglong / Ye, Ke et al. | 2022
- 1365
-
An augmented Lagrangian method for optimization problems with structured geometric constraintsJia, Xiaoxi / Kanzow, Christian / Mehlitz, Patrick / Wachsmuth, Gerd et al. | 2022
- 1417
-
Sum of squares generalizations for conic setsKapelevich, Lea / Coey, Chris / Vielma, Juan Pablo et al. | 2022