Výsledky vyhledávání - "Optimization problem with orthogonality constraints"
-
1
Orthogonal nonnegative matrix factorization problems for clustering: A new formulation and a competitive algorithm
ISSN: 0254-5330, 1572-9338Vydáno: New York Springer US 01.08.2024Vydáno v Annals of operations research (01.08.2024)“…Orthogonal Nonnegative Matrix Factorization (ONMF) with orthogonality constraints on a matrix has been found to provide better clustering results over existing…”
Získat plný text
Journal Article -
2
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
ISSN: 1055-6788, 1029-4937Vydáno: Abingdon Taylor & Francis 04.07.2022Vydáno v Optimization methods & software (04.07.2022)“…Updating the augmented Lagrangian multiplier by closed-form expression yields efficient first-order infeasible approach for optimization problems with orthogonality constraints…”
Získat plný text
Journal Article -
3
An Efficient Orthonormalization-Free Approach for Sparse Dictionary Learning and Dual Principal Component Pursuit
ISSN: 1424-8220, 1424-8220Vydáno: Switzerland MDPI 27.05.2020Vydáno v Sensors (Basel, Switzerland) (27.05.2020)“… ) maximization has been proposed to solve SDL, which reshapes the problem to an optimization problem with orthogonality constraints…”
Získat plný text
Journal Article -
4
Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 24.10.2018Vydáno v arXiv.org (24.10.2018)“…To construct a parallel approach for solving optimization problems with orthogonality constraints is usually regarded as an extremely difficult mission, due to the low scalability of the orthonormalization procedure…”
Získat plný text
Paper -
5
Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications
ISSN: 0018-9448, 1557-9654Vydáno: New York IEEE 01.02.2020Vydáno v IEEE transactions on information theory (01.02.2020)“…In this paper, we study tail inequalities of the largest eigenvalue of a matrix infinitely divisible (i.d.) series, which is a finite sum of fixed matrices…”
Získat plný text
Journal Article -
6
Structured learning for unsupervised feature selection with high-order matrix factorization
ISSN: 0957-4174, 1873-6793Vydáno: New York Elsevier Ltd 01.02.2020Vydáno v Expert systems with applications (01.02.2020)“…•Present one globally structured learning regularizer via sparse representation.•Establish a new method for optimization problem with orthogonality constraints…”
Získat plný text
Journal Article -
7
Improved Approximation Bound for Quadratic Optimization Problems with Orthogonality Constraints
Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2009Vydáno v Society for Industrial and Applied Mathematics and Association for Computing Machinery. Proceeding of the ACM-SIAM Symposium on Discrete Algorithms (01.01.2009)“…In this paper the authors consider the problem of approximating a class of quadratic optimization problems that contain orthogonality constraints, i.e…”
Získat plný text
Konferenční příspěvek -
8
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
ISSN: 0025-5610, 1436-4646Vydáno: Heidelberg Springer 01.03.2007Vydáno v Mathematical programming (01.03.2007)“…Let B i be deterministic real symmetric m x m matrices, and xi i be independent random scalars with zero mean and "of order of one" (e.g.,...). We are…”
Získat plný text
Journal Article Konferenční příspěvek -
9
A Global Cayley Parametrization of Stiefel Manifold for Direct Utilization of Optimization Mechanisms Over Vector Spaces
ISSN: 2379-190XVydáno: IEEE 01.01.2021Vydáno v Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) (01.01.2021)“…Optimization problem with orthogonality constraints, whose feasible region is called the Stiefel manifold, has rich applications in data sciences…”
Získat plný text
Konferenční příspěvek -
10
Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 30.05.2022Vydáno v arXiv.org (30.05.2022)“…In this paper, we study tail inequalities of the largest eigenvalue of a matrix infinitely divisible (i.d.) series, which is a finite sum of fixed matrices…”
Získat plný text
Paper -
11
A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
ISSN: 0168-9274, 1873-5460Vydáno: Elsevier B.V 01.12.2022Vydáno v Applied numerical mathematics (01.12.2022)“…In this paper, we propose an ascent algorithm by exploiting the Riemannian gradient, which is to solve the optimization problems with orthogonality constraints…”
Získat plný text
Journal Article -
12
A Splitting Method for Orthogonality Constrained Problems
ISSN: 0885-7474, 1573-7691Vydáno: Boston Springer US 01.02.2014Vydáno v Journal of scientific computing (01.02.2014)“… In this paper, a splitting method based on Bregman iteration is represented to tackle the optimization problems with orthogonality constraints…”
Získat plný text
Journal Article -
13
Implicit steepest descent algorithm for optimization with orthogonality constraints
ISSN: 1862-4472, 1862-4480Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022Vydáno v Optimization letters (01.07.2022)“…Optimization problems with orthogonality constraints appear widely in applications from science and engineering…”
Získat plný text
Journal Article -
14
Moment inequalities for sums of random matrices and their applications in optimization
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer-Verlag 01.11.2011Vydáno v Mathematical programming (01.11.2011)“… optimization problems with orthogonality constraints, has a logarithmic approximation guarantee. This improves…”
Získat plný text
Journal Article -
15
A Penalty-Free Infeasible Approach for a Class of Nonsmooth Optimization Problems Over the Stiefel Manifold
ISSN: 0885-7474, 1573-7691Vydáno: New York Springer US 01.05.2024Vydáno v Journal of scientific computing (01.05.2024)“…) for a class of optimization problems with orthogonality constraints and nonsmooth regularization term…”
Získat plný text
Journal Article -
16
Projected nonmonotone search methods for optimization with orthogonality constraints
ISSN: 0101-8205, 2238-3603, 1807-0302Vydáno: Cham Springer International Publishing 01.07.2018Vydáno v Computational & applied mathematics (01.07.2018)“…In this paper, we propose two feasible methods based on projections using a curvilinear search for solving optimization problems with orthogonality constraints…”
Získat plný text
Journal Article -
17
A Non-monotone Adaptive Scaled Gradient Projection Method for Orthogonality Constrained Problems
ISSN: 2349-5103, 2199-5796Vydáno: New Delhi Springer India 01.04.2024Vydáno v International journal of applied and computational mathematics (01.04.2024)“…Optimization problems with orthogonality constraints are classical nonconvex nonlinear problems and have been widely applied in science and engineering…”
Získat plný text
Journal Article -
18
Convex and Non-Convex Optimization Methods for Machine Learning
ISBN: 1392693918, 9781392693919Vydáno: ProQuest Dissertations & Theses 01.01.2019“…This dissertation is concerned with modeling fundamental and challenging machine learning tasks as convex/non-convex optimization problems and designing a…”
Získat plný text
Dissertation -
19
Accelerated First-Order Optimization with Orthogonality Constraints
ISBN: 0438009738, 9780438009738Vydáno: ProQuest Dissertations & Theses 01.01.2018“…Optimization problems with orthogonality constraints have many applications in science and engineering…”
Získat plný text
Dissertation -
20
A Penalty-free Infeasible Approach for a Class of Nonsmooth Optimization Problems over the Stiefel Manifold
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 28.03.2021Vydáno v arXiv.org (28.03.2021)“…Transforming into an exact penalty function model with convex compact constraints yields efficient infeasible approaches for optimization problems with orthogonality constraints. For smooth and \(\ell_{2,1…”
Získat plný text
Paper

