Pages that link to "Item:Q1915918"
From MaRDI portal
The following pages link to A convergence analysis for a convex version of Dikin's algorithm (Q1915918):
Displaying 14 items.
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- A trust region affine scaling method for bound constrained optimization (Q1942658) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming (Q2288182) (← links)
- Bounds on price of anarchy on linear cost functions (Q2351278) (← links)
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands (Q2389520) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- A trust region method based on a new affine scaling technique for simple bounded optimization (Q2867413) (← links)
- An augmented Lagrangian affine scaling method for nonlinear programming (Q3458825) (← links)
- Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
- New bounds for the price of anarchy under nonlinear and asymmetric costs (Q5413885) (← links)
