Image de couverture de livre

A conditional gradient homotopy method with applications to Semidefinite Programming

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dvurechensky, Pavel, Iommazzo, Gabriele, Shtern, Shimrit, Staudigl, Mathias
Format:	Preprint
Publié:	2022
Sujets:	Optimization and Control Machine Learning 90C22, 90C25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

Extragradient methods with complexity guarantees for hierarchical variational inequalities
par: Dvurechensky, Pavel, et autres
Publié: (2025)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
par: Namchaisiri, Charles, et autres
Publié: (2024)

Analysis of Kernel Mirror Prox for Measure Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
par: Namchaisiri, Charles, et autres
Publié: (2024)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
par: Liang, Ling, et autres
Publié: (2024)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
par: Prakhya, Karthik, et autres
Publié: (2026)

Improved global performance guarantees of second-order methods in convex minimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
par: Liang, Ling, et autres
Publié: (2024)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
par: Shtern, Shimrit, et autres
Publié: (2025)

A squared smoothing Newton method for semidefinite programming
par: Liang, Ling, et autres
Publié: (2023)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
par: Azuma, Godai, et autres
Publié: (2025)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
par: Nishioka, Akatsuki, et autres
Publié: (2023)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
par: Dolgopolik, M. V.
Publié: (2021)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
par: Hou, Di, et autres
Publié: (2025)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
par: Wang, Jie
Publié: (2022)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
par: Cifuentes, Diego, et autres
Publié: (2026)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
par: Tang, Tianyun, et autres
Publié: (2024)

On Second-Order Cone Functions
par: Jibrin, Shafiu, et autres
Publié: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
par: Wang, Jie, et autres
Publié: (2023)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
par: de Roux, Daniel, et autres
Publié: (2025)

Adaptive proximal gradient methods are universal without approximation
par: Oikonomidis, Konstantinos A., et autres
Publié: (2024)

Beyond binarity: Semidefinite programming for ternary quadratic problems
par: de Meijer, Frank, et autres
Publié: (2026)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
par: Zhang, Rui-Jin, et autres
Publié: (2025)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
par: Im, Haesol, et autres
Publié: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, et autres
Publié: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
par: Arima, Naohiko, et autres
Publié: (2024)

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Stochastic interior-point methods for smooth conic optimization with applications
par: He, Chuan, et autres
Publié: (2024)

Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite Programming
par: Chen, Liang, et autres
Publié: (2024)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
par: Nguyen, Vinh
Publié: (2025)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
par: Aguirre, Jacob, et autres
Publié: (2025)

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and its Implications
par: Wang, Shiwei, et autres
Publié: (2022)

A Positive Semidefinite Safe Approximation of Multivariate Distributionally Robust Constraints Determined by Simple Functions
par: Dienstbier, J., et autres
Publié: (2023)

Stratification for Nonlinear Semidefinite Programming
par: Bao, Chenglong, et autres
Publié: (2026)