Pages that link to "Item:Q5675136"

The following pages link to An iterative method, having linear rate of convergence, for solving a pair of dual linear programs (Q5675136):

Displaying 16 items.

• The gap function of a convex program (Q1165158) (← links)
• A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
• Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints (Q1214064) (← links)
• Minimization methods with constraints (Q1234628) (← links)
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II (Q1347145) (← links)
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165) (← links)
• Variational inequalities and discrete and continuum models of network equilibrium problems (Q1609502) (← links)
• A primal-dual subgradient method for time staged capacity expansion planning (Q1820669) (← links)
• Geometrically convergent projection method in matrix games (Q1897450) (← links)
• Time-dependent traffic equilibria (Q1964709) (← links)
• An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
• Convergence of the cyclical relaxation method for linear inequalities (Q3337217) (← links)
• Decomposition through formalization in a product space (Q3673556) (← links)
• On convergence rates of subgradient optimization methods (Q4145170) (← links)
• Validation of subgradient optimization (Q4770776) (← links)
• Iterative solution of convex problems by fejer-monotone methods (Q4883639) (← links)