On search directions for minimization algorithms
From MaRDI portal
Publication:5675555
DOI10.1007/BF01584660zbMath0258.90043OpenAlexW1979089199WikidataQ30040522 ScholiaQ30040522MaRDI QIDQ5675555
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584660
Related Items
Globally convergent block-coordinate techniques for unconstrained optimization, 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, Sparse topical analysis of dyadic data using matrix tri-factorization, Convergence of relaxation algorithms by averaging, Visualizing the effects of a changing distance on data using continuous embeddings, Block coordinate descent for smooth nonconvex constrained minimization, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Exact augmented lagrangian approach to multilevel optimization of large-scale systems, Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis, Some convergence results on the regularized alternating least-squares method for tensor decomposition, An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Separable Quaternion Matrix Factorization for Polarization Images, Random Coordinate Descent Methods for Nonseparable Composite Optimization, Relaxation methods for problems with strictly convex separable costs and linear constraints, Buffered and reduced multidimensional distribution functions and their application in optimization, Analysis of a variable metric block coordinate method under proximal errors, Total variation regularization on Riemannian manifolds by iteratively reweighted minimization, On global convergence of alternating least squares for tensor approximation, Towards analytical model optimization in atmospheric tomography, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version, Efficient algorithms for optimal control of quantum dynamics: the Krotov method unencumbered, Properties and methods for finding the best rank-one approximation to higher-order tensors, Learning low-complexity autoregressive models via proximal alternating minimization, Decomposition algorithm for convex differentiable minimization, Randomized Hessian estimation and directional search, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, Cournot tatonnement and potentials, Optimization Methods for Large-Scale Machine Learning, Convergent Decomposition Techniques for Training RBF Neural Networks, A convergent decomposition algorithm for support vector machines, Subspace clustering by \((k,k)\)-sparse matrix factorization, A coordinate gradient descent method for nonsmooth separable minimization, Convergence properties of relaxation algorithms, Projected Gradient Methods for Nonnegative Matrix Factorization, On the convergence of a class of algorithms using linearly independent search directions, Designing experiments for single output multilayer perceptrons, A block coordinate variable metric forward-backward algorithm, On the convergence of sequential minimization algorithms, Block Coordinate Descent Methods for Semidefinite Programming, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, A stochastic subspace approach to gradient-free optimization in high dimensions, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, Algorithms and applications for approximate nonnegative matrix factorization, Decomposition algorithms for generalized potential games, Improved row-by-row method for binary quadratic optimization problems, 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, Stochastic iterative dynamic programming: a Monte Carlo approach to dual control, Estimation of Ordinary Differential Equation Models with Discretization Error Quantification, Coordinate descent algorithms, On the convergence of the coordinate descent method for convex differentiable minimization, Control analysis and design via randomised coordinate polynomial minimisation
Cites Work
