Imagen de Portada

An efficient sieving based secant method for sparse optimization problems with least-squares constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Qian, Sun, Defeng, Yuan, Yancheng
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Adaptive sieving: A dimension reduction technique for sparse optimization problems
por: Yuan, Yancheng, et al.
Publicado: (2023)

A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
por: Feng, Yuchen, et al.
Publicado: (2025)

Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing
por: Wu, Can, et al.
Publicado: (2024)

HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems
por: Zhang, Guojun, et al.
Publicado: (2024)

Geometrically robust least squares through manifold optimization
por: Coulson, Jeremy, et al.
Publicado: (2025)

Error bound and exact penalty method for optimization problems with nonnegative orthogonal constraint
por: Qian, Yitian, et al.
Publicado: (2021)

Complexity analysis of regularization methods for implicitly constrained least squares
por: Onwunta, Akwum, et al.
Publicado: (2023)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
por: Yagishita, Shotaro
Publicado: (2024)

A least-square method for non-asymptotic identification in linear switching control
por: Sun, Haoyuan, et al.
Publicado: (2024)

Reduced order method based Anderson-type acceleration method for nonlinear least square problems and large scale ill-posed problems
por: Ito, Kazufumi, et al.
Publicado: (2025)

Regularized higher-order Taylor approximation methods for nonlinear least-squares
por: Nabou, Yassine, et al.
Publicado: (2025)

A fast iterative thresholding and support-and-scale shrinking algorithm (fits3) for non-lipschitz group sparse optimization (i): the case of least-squares fidelity
por: Zhao, Yanan, et al.
Publicado: (2025)

A derivative-free regularization algorithm for equality constrained nonlinear least squares problems
por: Chen, Xi, et al.
Publicado: (2025)

PyClustrPath: An efficient Python package for generating clustering paths with GPU acceleration
por: Wu, Hongfei, et al.
Publicado: (2025)

Risk reversal for least squares estimators under nested convex constraints
por: Al-Ghattas, Omar
Publicado: (2026)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
por: Birgin, Ernesto G., et al.
Publicado: (2025)

Lipschitz stability of least-squares problems regularized by functions with $\mathcal{C}^2$-cone reducible conjugates
por: Cui, Ying, et al.
Publicado: (2024)

dHPR: A Distributed Halpern Peaceman--Rachford Method for Non-smooth Distributed Optimization Problems
por: Feng, Zhangcheng, et al.
Publicado: (2025)

A metric function for dual quaternion matrices and related least-squares problems
por: Ling, Chen, et al.
Publicado: (2024)

Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis
por: Nabou, Yassine, et al.
Publicado: (2025)

Koopman-based control using sum-of-squares optimization: Improved stability guarantees and data efficiency
por: Strässer, Robin, et al.
Publicado: (2024)

Concentration inequalities for semidefinite least squares based on data
por: Fabiani, Filippo, et al.
Publicado: (2025)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
por: Pinheiro, Maria Eduarda, et al.
Publicado: (2024)

A variable dimension sketching strategy for nonlinear least-squares
por: Bellavia, Stefania, et al.
Publicado: (2025)

Integral control of the proximal gradient method for unbiased sparse optimization
por: Cerone, V., et al.
Publicado: (2025)

Variable projection framework for the reduced-rank matrix approximation problem by weighted least-squares
por: Terray, Pascal
Publicado: (2025)

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

Soft quasi-Newton: Guaranteed positive definiteness by relaxing the secant constraint
por: Berglund, Erik, et al.
Publicado: (2024)

Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
por: Bellavia, Stefania, et al.
Publicado: (2023)

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
por: Chervonenkis, Boris, et al.
Publicado: (2024)

Stochastic gradient with least-squares control variates
por: Nobile, Fabio, et al.
Publicado: (2025)

Second-order optimality conditions for optimization problems with generalized equation constraints
por: Benko, M., et al.
Publicado: (2026)

A model reduction method based on nonlinear optimization for multiscale stochastic optimal control problems
por: Ma, Lingling, et al.
Publicado: (2025)

A note on the generalised Hessian of the least squares associated with systems of linear inequalities
por: Dolgopolik, M. V.
Publicado: (2024)

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
por: Liu, Peng, et al.
Publicado: (2025)

The Aubin Property for Generalized Equations over $C^2$-cone Reducible Sets
por: Ma, Jiaming, et al.
Publicado: (2025)

A sparse ADMM-based solver for linear MPC subject to terminal quadratic constraint
por: Krupa, Pablo, et al.
Publicado: (2021)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
por: Khajavirad, Aida
Publicado: (2026)

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

Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization
por: Li, Yan, et al.
Publicado: (2024)