On search directions for minimization algorithms
From MaRDI portal
Cites work
Cited in
(68)- Algorithms and applications for approximate nonnegative matrix factorization
- Convergence of relaxation algorithms by averaging
- Decomposition algorithm for convex differentiable minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Visualizing the effects of a changing distance on data using continuous embeddings
- Learning low-complexity autoregressive models via proximal alternating minimization
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- A stochastic subspace approach to gradient-free optimization in high dimensions
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- Curiosities and counterexamples in smooth convex optimization
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Block coordinate descent for smooth nonconvex constrained minimization
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
- Improved row-by-row method for binary quadratic optimization problems
- Coordinate descent algorithms
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- A convergent decomposition algorithm for support vector machines
- Stochastic iterative dynamic programming: a Monte Carlo approach to dual control
- On global convergence of alternating least squares for tensor approximation
- Convergent decomposition techniques for training RBF neural networks
- Block coordinate descent methods for semidefinite programming
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results
- Towards analytical model optimization in atmospheric tomography
- Randomized Hessian estimation and directional search
- Sparse topical analysis of dyadic data using matrix tri-factorization
- An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems
- Exact augmented lagrangian approach to multilevel optimization of large-scale systems
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- On the convergence of a class of algorithms using linearly independent search directions
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Globally convergent block-coordinate techniques for unconstrained optimization
- Total variation regularization on Riemannian manifolds by iteratively reweighted minimization
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Optimization methods for large-scale machine learning
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- Cournot tatonnement and potentials
- Designing experiments for single output multilayer perceptrons
- Control analysis and design via randomised coordinate polynomial minimisation
- Efficient algorithms for optimal control of quantum dynamics: the Krotov method unencumbered
- Convergence properties of relaxation algorithms
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Estimation of ordinary differential equation models with discretization error quantification
- On the convergence of sequential minimization algorithms
- Separable Quaternion Matrix Factorization for Polarization Images
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Buffered and reduced multidimensional distribution functions and their application in optimization
- Analysis of a variable metric block coordinate method under proximal errors
- Convex Bidirectional Large Margin Classifiers
- A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging
- Domain decomposition for integer optimal control with total variation regularization
- A generalized factor rotation framework with customized regularization
- An adaptive block Bregman proximal gradient method for computing stationary states of multicomponent phase-field crystal model
- Reducing computational complexity in nonlinear model input design via sparse estimation
- Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
- Using filter methods to guide convergence for ADMM, with applications to nonnegative matrix factorization problems
- Optimization tools for PDE-informed regression in river model training
- A block coordinate variable metric forward-backward algorithm
- An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
- Decomposition algorithms for generalized potential games
- A coordinate gradient descent method for nonsmooth separable minimization
This page was built for publication: On search directions for minimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675555)
