zbMATH — the first resource for mathematics

The gap function of a convex program. (English) Zbl 0486.90070

90C25 Convex programming
49N15 Duality theory (optimization)
Full Text: DOI
[1] Dafermos, S.C., Traffic equilibrium and variational inequalities, Transportation sci., 6, 73-87, (1980)
[2] Frank, M.; Wolfe, P., An algorithm for quadratic programming, Naval res. logist. quart., 3, 95-110, (1956)
[3] Hearn, D.W., Network aggregation in transportation planning models, ()
[4] Oettli, W., An iterative method, having linear rate of convergence, for solving a pair of dual linear programs, Math. programming, 3, 302-311, (1972) · Zbl 0259.90019
[5] Polyak, B.T., Minimization of unsmooth functionals, U.S.S.R. computational math. and math. phys., 9, 14-29, (1969) · Zbl 0229.65056
[6] Rockafellar, R.T., The theory of subgradients and its applications to problems of optimization, (1981), Heldermann Berlin · Zbl 0462.90052
[7] Smith, M.J., Existence, uniqueness and stability of traffic assignment, Transportation res., B13, 295-304, (1979)
[8] Wolfe, P., A duality theorem for nonlinear programming, Quart. appl. math., 19, 239-244, (1961) · Zbl 0109.38406
[9] Wolfe, P., Convergence in nonlinear programming, () · Zbl 0336.90045
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.