The following pages link to (Q3730336):
Displaying 50 items.
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- Single-projection procedure for linear optimization (Q330507) (← links)
- An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem (Q442108) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Duality and network theory in passivity-based cooperative control (Q466277) (← links)
- Random variables, monotone relations, and convex analysis (Q484142) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- An augmented Lagrangian method for distributed optimization (Q494348) (← links)
- On a zero duality gap result in extended monotropic programming (Q620434) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- A primal-dual simplex method for linear programs (Q688212) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
- Biproportional scaling of matrices and the iterative proportional fitting procedure (Q744690) (← links)
- Optimal control on a graph with application to train scheduling problems (Q753655) (← links)
- Railway scheduling by network optimization (Q753674) (← links)
- Edge-directions of standard polyhedra with applications to network flows (Q811875) (← links)
- Polynomial-time identification of robust network flows under uncertain arc failures (Q839810) (← links)
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm (Q868125) (← links)
- Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
- Potential games with incomplete preferences (Q898661) (← links)
- Cooperative maximum-flow problem under uncertainty in logistic networks (Q902866) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- Relaxation methods for monotropic programs (Q909583) (← links)
- Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem (Q910459) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability (Q976369) (← links)
- Extended monotropic programming and duality (Q1014019) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Computing delay resistant railway timetables (Q1046699) (← links)
- A Z-simplex algorithm with partial updates (Q1097835) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Geometric interpretation of the optimality conditions in multifacility location and applications (Q1120460) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Characterizations of max-balanced flows (Q1201811) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
