Pages that link to "Item:Q4254662"
From MaRDI portal
The following pages link to Globally convergent block-coordinate techniques for unconstrained optimization (Q4254662):
Displaying 38 items.
- An incremental decomposition method for unconstrained optimization (Q272371) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
- A decomposition algorithm for unconstrained optimization problems with partial derivative information (Q691378) (← links)
- Low rank matrix completion by alternating steepest descent methods (Q905914) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
- A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
- Some convergence results on the regularized alternating least-squares method for tensor decomposition (Q1931768) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (Q1977647) (← links)
- A non-convex regularization approach for compressive sensing (Q2000486) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- Network manipulation algorithm based on inexact alternating minimization (Q2109010) (← links)
- On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces (Q2115326) (← links)
- Block layer decomposition schemes for training deep neural networks (Q2173515) (← links)
- Numerical minimization of a second-order functional for image segmentation (Q2198869) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
- Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional (Q2422864) (← links)
- A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
- Global optimization issues in deep network regression: an overview (Q2633536) (← links)
- An automatic \(L_1\)-based regularization method for the analysis of FFC dispersion profiles with quadrupolar peaks (Q2698074) (← links)
- Convergent Decomposition Techniques for Training RBF Neural Networks (Q2746344) (← links)
- Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano (Q4624932) (← links)
- A variational non-linear constrained model for the inversion of FDEM data* (Q5019919) (← links)
- The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem (Q5149516) (← links)
- On the convergence of a modified version of SVM<i><sup>light</sup></i>algorithm (Q5317752) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces (Q6057154) (← links)
- Inexact penalty decomposition methods for optimization problems with geometric constraints (Q6133301) (← links)
- Buffered and reduced multidimensional distribution functions and their application in optimization (Q6191974) (← links)
- Analysis of a variable metric block coordinate method under proximal errors (Q6195234) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)