What people are saying - Write a review
We haven't found any reviews in the usual places.
QPBased Methods for LargeScale Nonlinearly Constrained Optimization
Numerical Experiments with an Exact Penalty Function Method
An Iterative Linear Programming Algorithm Based on an Augmented
17 other sections not shown
Other editions - View all
applied approximation scheme BFGS bound complementarity problem computed conjugate gradient method constrained optimization convex function convex programming convex set defined denote derivative descent direction ellipsoid algorithm equations exists feasible solution follows given go to Step Hence Hessian ICP(l implies inequality integer interval iteration J. L. Goffin Lagrange multipliers Lemma lems limsup line search linear complementarity problem linear programming mapping Mathematical Programming matrix monotropic monotropic programming N. Z. Shor nonlinear programming nonsingular number of operations objective function obtain Operations Research optimal solution parameters piecewise linear polynomial positive definite prob procedure programming problems Proof Proposition quadratic programming quasi-Newton quasi-Newton methods rate of convergence satisfies Section sequence solving subgradient optimization subproblem subset subspace symmetric test problems Theorem tion update upper plane variable metric zero