Image de couverture de livre

A squared smoothing Newton method for semidefinite programming

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liang, Ling, Sun, Defeng, Toh, Kim-Chuan
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control 90C06, 90C22, 90C25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
par: Tang, Tianyun, et autres
Publié: (2026)

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

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

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
par: Hou, Di, et autres
Publié: (2023)

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

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
par: Yang, Lei, et autres
Publié: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, 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)

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

HPR-LP: An implementation of an HPR method for solving linear programming
par: Chen, Kaihuang, et autres
Publié: (2024)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
par: Hou, Di, et autres
Publié: (2025)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
par: Chen, Kaihuang, et autres
Publié: (2025)

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
par: Chen, Kaihuang, et autres
Publié: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)

Solving exact and noisy rank-one tensor completion with semidefinite programming
par: Cifuentes, Diego, et autres
Publié: (2025)

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

Computational complexity of sum-of-squares bounds for copositive programs
par: Palomba, Marilena, et autres
Publié: (2025)

Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
par: Tran, Hoang Anh, et autres
Publié: (2024)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
par: Chen, Kaihuang, et autres
Publié: (2025)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
par: Deng, Kangkang, et autres
Publié: (2024)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
par: Chen, Liang, et autres
Publié: (2025)

Alternating minimization for square root principal component pursuit
par: Deng, Shengxiang, et autres
Publié: (2024)

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
par: Liang, Ling, et autres
Publié: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2023)

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

On generators of $k$-PSD closures of the positive semidefinite cone
par: Bhardwaj, Avinash, et autres
Publié: (2024)

A semidefinite programming hierarchy for covering problems in discrete geometry
par: Riener, Cordian, et autres
Publié: (2023)

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

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

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)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
par: Tran-Dinh, Quoc
Publié: (2024)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

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

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

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

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

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

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
par: Li, Huimin, et autres
Publié: (2025)

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