Copertina

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liang, Ling, Toh, Kim-Chuan, Yang, Haizhao
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Machine Learning 90C06, 90C22, 90C25
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A squared smoothing Newton method for semidefinite programming
di: Liang, Ling, et al.
Pubblicazione: (2023)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
di: Liang, Ling, et al.
Pubblicazione: (2024)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
di: Hou, Di, et al.
Pubblicazione: (2023)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
di: Yang, Lei, et al.
Pubblicazione: (2023)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
di: Tang, Tianyun, et al.
Pubblicazione: (2026)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
di: Giang-Tran, Khanh-Hung, et al.
Pubblicazione: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
di: Cifuentes, Diego, et al.
Pubblicazione: (2026)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
di: Song, Yongcun, et al.
Pubblicazione: (2024)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
di: Hou, Di, et al.
Pubblicazione: (2025)

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

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
di: Liang, Ling, et al.
Pubblicazione: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
di: Zhang, Rui-Jin, et al.
Pubblicazione: (2025)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
di: Marumo, Hiroki, et al.
Pubblicazione: (2024)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
di: Tran-Dinh, Quoc
Pubblicazione: (2024)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
di: Xu, Mingming, et al.
Pubblicazione: (2026)

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
di: Roth, Jake, et al.
Pubblicazione: (2024)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
di: Chen, Liang, et al.
Pubblicazione: (2025)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
di: Lin, Zhenwei, et al.
Pubblicazione: (2022)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

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

On Second-Order Cone Functions
di: Jibrin, Shafiu, et al.
Pubblicazione: (2023)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
di: Tran-Dinh, Quoc
Pubblicazione: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
di: Tran-Dinh, Quoc, et al.
Pubblicazione: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
di: Sun, Defeng, et al.
Pubblicazione: (2024)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
di: Tran-Dinh, Quoc, et al.
Pubblicazione: (2025)

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

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
di: Bai, Xiaoning, et al.
Pubblicazione: (2022)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
di: Chen, Kaihuang, et al.
Pubblicazione: (2025)