Pages that link to "Item:Q1977647"
From MaRDI portal
The following pages link to On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (Q1977647):
Displaying 50 items.
- Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Sparse topical analysis of dyadic data using matrix tri-factorization (Q331699) (← links)
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← links)
- A classification of methods for distributed system optimization based on formulation structure (Q381334) (← links)
- Multi-modality in augmented Lagrangian coordination for distributed optimal design (Q381380) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- Efficient nonnegative matrix factorization via projected Newton method (Q437490) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Decomposition algorithms for generalized potential games (Q763403) (← links)
- Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF) (Q777470) (← links)
- A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications (Q985529) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Algorithms and applications for approximate nonnegative matrix factorization (Q1020797) (← links)
- Fast inference of individual admixture coefficients using geographic data (Q1647644) (← links)
- Optimal estimation of sensor biases for asynchronous multi-sensor data fusion (Q1650785) (← links)
- Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm (Q1653941) (← links)
- DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling (Q1675578) (← links)
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems (Q1679841) (← links)
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
- A general framework for predictive tensor modeling with domain knowledge (Q1715916) (← links)
- Bound alternative direction optimization for image deblurring (Q1717868) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Toward fast transform learning (Q1799980) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Some convergence results on the regularized alternating least-squares method for tensor decomposition (Q1931768) (← links)
- Musings on multilinear fitting (Q1931770) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- An adaptive procedure for the global minimization of a class of polynomial functions (Q2004881) (← links)
- Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent (Q2015273) (← links)
- Numerical method for the generalized nonnegative tensor factorization problem (Q2028020) (← links)
- Minimal-norm static feedbacks using dissipative Hamiltonian matrices (Q2029851) (← links)
- Double fused Lasso regularized regression with both matrix and vector valued predictors (Q2044365) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- Gaussian process regression for pricing variable annuities with stochastic volatility and interest rate (Q2044803) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- A proximal point like method for solving tensor least-squares problems (Q2070322) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
