scientific article; zbMATH DE number 3383729

zbMath0242.90020MaRDI QIDQ5653783

J. D. Pearson, Freerk A. Lootsma

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Exact penalty functions in nonlinear programming ⋮ Constrained optimization with normed moving truncations penalty-functions ⋮ Hybrid computation in mathematical programming ⋮ Convergence bounds for nonlinear programming algorithms ⋮ A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations ⋮ Globally solving nonconvex quadratic programming problems via completely positive programming ⋮ Rates of convergence for a method of centers algorithm ⋮ Interior point penalty functions for constrained minimization ⋮ An exact penalty function for nonlinear programming with inequalities ⋮ On the convergence rate for a penalty function method of exponential type ⋮ Multiple criteria decision making with interactive over-achievement programming ⋮ On the classical logarithmic barrier function method for a class of smooth convex programming problems

This page was built for publication: