Pages that link to "Item:Q4912757"
From MaRDI portal
The following pages link to Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint (Q4912757):
Displaying 50 items.
- The sparse principal component analysis problem: optimality conditions and algorithms (Q306306) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
- A Newton conditional gradient method for constrained nonlinear systems (Q730572) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- An inexact Newton-like conditional gradient method for constrained nonlinear systems (Q1651415) (← links)
- Sparse exploratory factor analysis (Q1682447) (← links)
- Conditional gradient type methods for composite nonlinear and stochastic optimization (Q1717236) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem (Q1785372) (← links)
- Rank-one approximation of positive matrices based on methods of tropical mathematics (Q1792332) (← links)
- On the robust PCA and Weiszfeld's algorithm (Q2019909) (← links)
- Projections onto the intersection of a one-norm ball or sphere and a two-norm ball or sphere (Q2025292) (← links)
- Conditional gradient method for multiobjective optimization (Q2028470) (← links)
- Alternating conditional gradient method for convex feasibility problems (Q2044579) (← links)
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes (Q2129204) (← links)
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer (Q2161912) (← links)
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors (Q2162522) (← links)
- On the rotational invariant \(L_1\)-norm PCA (Q2174418) (← links)
- Two relaxation methods for rank minimization problems (Q2198528) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- On the rank-one approximation of positive matrices using tropical optimization methods (Q2289366) (← links)
- Certifiably optimal sparse principal component analysis (Q2293653) (← links)
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms (Q2800370) (← links)
- Conditional gradient sliding for convex optimization (Q2816241) (← links)
- Nonconvex phase synchronization (Q2832892) (← links)
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods (Q4571045) (← links)
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization (Q4602339) (← links)
- Near-Optimal Bounds for Phase Synchronization (Q4637501) (← links)
- Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems (Q5003218) (← links)
- First-Order Algorithms for a Class of Fractional Optimization Problems (Q5026841) (← links)
- On the Frank–Wolfe algorithm for non-compact constrained optimization problems (Q5034936) (← links)
- (Q5038021) (← links)
- An inexact first-order method for constrained nonlinear optimization (Q5038172) (← links)
- Projection-free accelerated method for convex optimization (Q5038178) (← links)
- (Q5054600) (← links)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
- Inexact primal–dual gradient projection methods for nonlinear optimization on convex set (Q5151505) (← links)
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints (Q5158760) (← links)
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence (Q5219695) (← links)
- An active-set proximal quasi-Newton algorithm for ℓ<sub>1</sub>-regularized minimization over a sphere constraint (Q5870141) (← links)
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity (Q6078423) (← links)
- A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints (Q6079984) (← links)
- A unified approach to synchronization problems over subgroups of the orthogonal group (Q6117023) (← links)
- Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors (Q6124341) (← links)
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems (Q6126066) (← links)
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems (Q6155872) (← links)
- PCA Sparsified (Q6176425) (← links)
