Parallel Gradient Distribution in Unconstrained Optimization
From MaRDI portal
Publication:4862443
DOI10.1137/S0363012993250220zbMath0843.90111MaRDI QIDQ4862443
Publication date: 8 February 1996
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Related Items
Globally convergent block-coordinate techniques for unconstrained optimization, Consensus-based modeling using distributed feature construction with ILP, Computing aviation sparing policies: solving a large nonlinear integer program, Parallel Uzawa method for large-scale minimization of partially separable functions, Online learning via congregational gradient descent, Parallel algorithm for unconstrained optimization based on decomposition techniques, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Two parallel distribution algorithms for convex constrained minimization problems, Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties, On Lagrangian L2-norm pinball twin bounded support vector machine via unconstrained convex minimization, Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional, Space-decomposition minimization method for large-scale minimization problems, A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization, Exactness conditions for a convex differentiable exterior penalty for linear programming, Decomposition in derivative-free optimization, A method for solving the system of linear equations and linear inequalities, A coordinate gradient descent method for nonsmooth separable minimization, A Newton method for linear programming, Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization, Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems, On a second order parallel variable transformation approach.
