Pages that link to "Item:Q1176837"

The following pages link to Decomposition algorithm for convex differentiable minimization (Q1176837):

Displaying 10 items.

• An approximate decomposition algorithm for convex minimization (Q966076) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
• A class of gap functions for variational inequalities (Q1330894) (← links)
• Decomposition methods for differentiable optimization problems over Cartesian product sets (Q1383825) (← links)
• A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem (Q1644557) (← links)
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints (Q1977647) (← links)
• A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
• Globally convergent block-coordinate techniques for unconstrained optimization (Q4254662) (← links)
• Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)