Copertina

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Singh, Vikram, Sun, Min
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control 90C26, 90C57, 65K05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
di: Tawarmalani, Mohit
Pubblicazione: (2024)

Solving the Best Subset Selection Problem via Suboptimal Algorithms
di: Singh, Vikram, et al.
Pubblicazione: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
di: Xie, Lijun, et al.
Pubblicazione: (2025)

Global optimization of multivariable functions satisfying the Vanderbei condition
di: Arutyunova, Natalya, et al.
Pubblicazione: (2019)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
di: Zhou, Juan, et al.
Pubblicazione: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
di: Xie, Xiyuan, et al.
Pubblicazione: (2025)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
di: Lin, Yizun, et al.
Pubblicazione: (2023)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
di: Xie, Xiyuan, et al.
Pubblicazione: (2026)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
di: Kannan, Rohit, et al.
Pubblicazione: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
di: Marumo, Naoki
Pubblicazione: (2025)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
di: Nandhan, Navil, et al.
Pubblicazione: (2026)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
di: Chen, Xiaojun, et al.
Pubblicazione: (2022)

A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization
di: Hong, Tenglong, et al.
Pubblicazione: (2026)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
di: Engquist, Björn, et al.
Pubblicazione: (2022)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
di: Li, Wenjing, et al.
Pubblicazione: (2023)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
di: Marumo, Naoki, et al.
Pubblicazione: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
di: Li, Qia, et al.
Pubblicazione: (2024)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
di: Lin, Yizun, et al.
Pubblicazione: (2024)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
di: Gfrerer, H.
Pubblicazione: (2024)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
di: Li, Luxuan, et al.
Pubblicazione: (2026)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, et al.
Pubblicazione: (2025)

Steiner Cut Dominants
di: Conforti, Michele, et al.
Pubblicazione: (2022)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
di: Turan, Evren M., et al.
Pubblicazione: (2023)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
di: Deng, Kangkang, et al.
Pubblicazione: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
di: Fest, Jean-Baptiste, et al.
Pubblicazione: (2023)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
di: Dolgopolik, M. V.
Pubblicazione: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
di: Pérez-Aros, Pedro, et al.
Pubblicazione: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
di: Zhou, Junpeng, et al.
Pubblicazione: (2025)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
di: Zhu, Kehan, et al.
Pubblicazione: (2026)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
di: Zhang, Minxin, et al.
Pubblicazione: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
di: Han, Deren, et al.
Pubblicazione: (2025)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
di: Krejić, Nataša, et al.
Pubblicazione: (2025)

Local Convergence of Adaptively Regularized Tensor Methods
di: Welzel, Karl, et al.
Pubblicazione: (2025)

Optimization in complex spaces with the Mixed Newton Method
di: Bakhurin, Sergey, et al.
Pubblicazione: (2022)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
di: Kamijima, Tomoya, et al.
Pubblicazione: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
di: Lara, Felipe, et al.
Pubblicazione: (2024)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
di: Bai, Xiaoning, et al.
Pubblicazione: (2024)