Cover Image

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xu, Xin
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C20, 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
by: Xu, Xin
Published: (2024)

Regularized Barzilai-Borwein method
by: An, Congpei, et al.
Published: (2022)

Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
by: Shen, Ya, et al.
Published: (2025)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

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

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

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

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

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

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

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
by: Chen, Kaihuang, et al.
Published: (2025)

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

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

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

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
by: Bomze, Immanuel, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Tractable downfall of basis pursuit in structured sparse optimization
by: Marmary, Maya V., et al.
Published: (2025)

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

HPR-LP: An implementation of an HPR method for solving linear programming
by: Chen, Kaihuang, et al.
Published: (2024)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
by: Azuma, Godai, et al.
Published: (2025)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

On Convergence and Stability of Two Extended BB-like Step Sizes
by: Xu, Xin
Published: (2025)

On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set
by: Roth, Jake, et al.
Published: (2023)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
by: Starnes, Andrew, et al.
Published: (2023)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

Aggregating regular norms
by: Juditsky, Anatoli, et al.
Published: (2022)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
by: Kharitenko, Andrey, et al.
Published: (2025)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

A high-order augmented Lagrangian method with arbitrarily fast convergence
by: Lee, Young-Ju, et al.
Published: (2026)

Fast convergence of Frank-Wolfe algorithms on polytopes
by: Wirth, Elias, et al.
Published: (2024)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

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