Copertina

Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Yan, Sun, Defeng, Zhang, Liping
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Progressive Bound Strengthening via Doubly Nonnegative Cutting Planes for Nonconvex Quadratic Programs
di: Qu, Zheng, et al.
Pubblicazione: (2025)

Efficient Online Prediction for High-Dimensional Time Series via Joint Tensor Tucker Decomposition
di: Luan, Zhenting, et al.
Pubblicazione: (2024)

Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy
di: Qin, Zhenzhi, et al.
Pubblicazione: (2024)

Enhancing Unsupervised Feature Selection via Double Sparsity Constrained Optimization
di: Xiu, Xianchao, et al.
Pubblicazione: (2025)

On Error Bounds for Rank-Constrained Affine Matrix Sets
di: Chen, Ruoning, et al.
Pubblicazione: (2025)

Constrained Regularization by Denoising with Automatic Parameter Selection
di: Cascarano, Pasquale, et al.
Pubblicazione: (2023)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
di: Wang, Lei, et al.
Pubblicazione: (2025)

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

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
di: Ma, Chiyu, et al.
Pubblicazione: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
di: Majumdar, Angshul
Pubblicazione: (2026)

An efficient sieving based secant method for sparse optimization problems with least-squares constraints
di: Li, Qian, et al.
Pubblicazione: (2023)

Reweighted Quasi Norm Regularized Low-Rank Factorization for Matrix Robust PCA
di: Qin, Zhenzhi, et al.
Pubblicazione: (2024)

Bi-Sparse Unsupervised Feature Selection
di: Xiu, Xianchao, et al.
Pubblicazione: (2024)

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

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

An Accelerated Proximal Alternating Direction Method of Multipliers for Optimal Decentralized Control of Uncertain Systems
di: Yang, Bo, et al.
Pubblicazione: (2023)

Accelerated Nonnegative Tensor Completion via Integer Programming
di: Pan, Wenhao, et al.
Pubblicazione: (2022)

Inexact Newton-type Methods for Optimisation with Nonnegativity Constraints
di: Smee, Oscar, et al.
Pubblicazione: (2024)

Adaptive Gradient Descent on Riemannian Manifolds with Nonnegative Curvature
di: Ansari-Önnestam, Aban, et al.
Pubblicazione: (2025)

Minimal Actuator Selection
di: Ballotta, Luca, et al.
Pubblicazione: (2026)

Complexity of Minimizing Regularized Convex Quadratic Functions
di: Thomsen, Daniel Berg, et al.
Pubblicazione: (2024)

Joint Majorization-Minimization for Nonnegative CP and Tucker Decompositions under $β$-Divergences: Unfolding-Free Updates
di: Leplat, Valentin
Pubblicazione: (2026)

Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models
di: Cohen, Jeremy E., et al.
Pubblicazione: (2024)

Learning Graph Laplacian with MCP
di: Zhang, Yangjing, et al.
Pubblicazione: (2020)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
di: Jiang, Xiaotian, et al.
Pubblicazione: (2026)

Induced Norm Analysis of Linear Systems for Nonnegative Input Signals
di: Ebihara, Yoshio, et al.
Pubblicazione: (2024)

Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
di: Gould, Brendan, et al.
Pubblicazione: (2026)

A Novel Loss Function-based Support Vector Machine for Binary Classification
di: Li, Yan, et al.
Pubblicazione: (2024)

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

An NEPv Approach for Feature Selection via Orthogonal OCCA with the (2,1)-norm Regularization
di: Wang, Li, et al.
Pubblicazione: (2025)

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
di: Zhuang, Yubo, et al.
Pubblicazione: (2023)

Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection
di: Zhang, Qixin, et al.
Pubblicazione: (2026)

High-order Accumulative Regularization for Gradient Minimization in Convex Programming
di: Ji, Yao, et al.
Pubblicazione: (2025)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
di: Leplat, Valentin, et al.
Pubblicazione: (2021)

Identification with Orthogonal Basis Functions: Convergence Speed, Asymptotic Bias, and Rate-Optimal Pole Selection
di: Li, Jiayun, et al.
Pubblicazione: (2025)

Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle
di: Richtárik, Peter, et al.
Pubblicazione: (2026)

Accelerating Regularized Attention Kernel Regression for Spectrum Cartography
di: Tao, Liping, et al.
Pubblicazione: (2026)

Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination
di: Zhu, Zhihan, et al.
Pubblicazione: (2025)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
di: Baeckelant, Timothy, et al.
Pubblicazione: (2026)

Sum-of-norms regularized Nonnegative Matrix Factorization
di: Ang, Andersen, et al.
Pubblicazione: (2024)