Pages that link to "Item:Q4862443"
From MaRDI portal
The following pages link to Parallel Gradient Distribution in Unconstrained Optimization (Q4862443):
Displayed 15 items.
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- A Newton method for linear programming (Q704747) (← links)
- Computing aviation sparing policies: solving a large nonlinear integer program (Q853674) (← links)
- Two parallel distribution algorithms for convex constrained minimization problems (Q884654) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Online learning via congregational gradient descent (Q1377562) (← links)
- Parallel algorithm for unconstrained optimization based on decomposition techniques (Q1379930) (← links)
- On a second order parallel variable transformation approach. (Q1871435) (← links)
- Space-decomposition minimization method for large-scale minimization problems (Q1963007) (← links)
- A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization (Q2454987) (← links)
- A method for solving the system of linear equations and linear inequalities (Q2467154) (← links)
- Exactness conditions for a convex differentiable exterior penalty for linear programming (Q2996786) (← links)
- Globally convergent block-coordinate techniques for unconstrained optimization (Q4254662) (← links)
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems (Q4700279) (← links)
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization (Q5437525) (← links)