Cover Image

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gu, Ran, Gao, Bing
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control 90C20, 90C25, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
by: Huo, Xinyue, et al.
Published: (2024)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

A Dual Method for Minimax Quadratic Programming
by: Ren, Wenhui, et al.
Published: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

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

Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
by: Bartz, Sedi, et al.
Published: (2026)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

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

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

A Flexible Algorithmic Framework for Strictly Convex Quadratic Minimization
by: MacDonald, Liam, et al.
Published: (2025)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

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

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

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
by: Ran, Yifan
Published: (2023)

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

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
by: Chen, Yiwen, et al.
Published: (2023)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

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

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

Active set identification and rapid convergence for degenerate primal-dual problems
by: Díaz, Mateo, et al.
Published: (2026)

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2025)

Bregman proximal gradient method for linear optimization under entropic constraints
by: Briceño-Arias, Luis M., et al.
Published: (2025)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
by: Ghosh, Suprova, et al.
Published: (2025)

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
by: Ouyang, Wenqing, et al.
Published: (2023)

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

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

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)