Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems

DOI10.1007/BF01588312zbMath0433.90069MaRDI QIDQ3872219

Daniel Solow

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

fixed pointsconstrained optimizationequality constraintscomputational efficiencytest problemsinequality constraintscomparison of algorithmsnumerical experiencegeneralized reduced gradient methodcomplementary pivot algorithmcomplementary pivoting algorithmscomparative computer results

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Solving inequality constrained optimization problems by differential homotopy continuation methods

Cites Work

• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Convex Analysis
• Homotopies for computation of fixed points on unbounded regions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems