Parallel Gradient Distribution in Unconstrained Optimization

DOI10.1137/S0363012993250220zbMath0843.90111MaRDI QIDQ4862443

Olvi L. Mangasarian

Publication date: 8 February 1996

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

zbMATH Keywords

conjugate gradient algorithm; parallel optimization; serial unconstrained optimization

Mathematics Subject Classification ID

90C30: Nonlinear programming

65Y05: Parallel numerical computation

Related Items

Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems, Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization, Approximation accuracy, gradient methods, and error bound for structured convex optimization, A Newton method for linear programming, Computing aviation sparing policies: solving a large nonlinear integer program, Two parallel distribution algorithms for convex constrained minimization problems, A coordinate gradient descent method for nonsmooth separable minimization, Online learning via congregational gradient descent, Parallel algorithm for unconstrained optimization based on decomposition techniques, On a second order parallel variable transformation approach., Space-decomposition minimization method for large-scale minimization problems, A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization, A method for solving the system of linear equations and linear inequalities, Exactness conditions for a convex differentiable exterior penalty for linear programming, Globally convergent block-coordinate techniques for unconstrained optimization