Active set strategies in an ellipsoid algorithm for nonlinear programming

DOI10.1016/S0305-0548(03)00045-5zbMath1061.90106MaRDI QIDQ1433159

Edgar K. Rugenstein, Michael Kupferschmid

Publication date: 15 June 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

ellipsoid algorithmequality constraintsnonlinear optimizationcomputational experimentsperformance profilesActive set strategyrestarting strategy

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Related Items (1)

A cutting-plane method to nonsmooth multiobjective optimization problems

Cites Work

• Test examples for nonlinear programming codes
• Handbook of test problems in local and global optimization
• Global minimization by reducing the duality gap
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• Combined lp and quasi-Newton methods for minimax optimization
• A Geometric Programming Model for Optimal Allocation of Stream Dissolved Oxygen
• A set of geometric programming test problems and their solutions
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Active set strategies in an ellipsoid algorithm for nonlinear programming