Active set strategies in an ellipsoid algorithm for nonlinear programming

DOI10.1016/S0305-0548(03)00045-5MaRDI QIDQ1433159zbMATH OpenFDO

Authors Edgar K. Rugenstein, Michael Kupferschmid

Publication date 15 June 2004

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

zbMATH Keywords

nonlinear optimizationcomputational experimentsequality constraintsperformance profilesellipsoid algorithmActive set strategyrestarting strategy

Mathematics Subject Classification ID

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

Recommendations

• An ellipsoid algorithm for equality-constrained nonlinear programs
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• Using deep cuts in an ellipsoid algorithm for nonlinear programming
• An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
• A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem.

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• scientific article; zbMATH DE number 3825682 (Why is no real title available?)
• scientific article; zbMATH DE number 3694049 (Why is no real title available?)
• scientific article; zbMATH DE number 3711742 (Why is no real title available?)
• scientific article; zbMATH DE number 193128 (Why is no real title available?)
• scientific article; zbMATH DE number 3308855 (Why is no real title available?)
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• 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.
• Combined lp and quasi-Newton methods for minimax optimization
• Global minimization by reducing the duality gap
• Handbook of test problems in local and global optimization
• Test examples for nonlinear programming codes
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations

Cited in

(11)

• Using deep cuts in an ellipsoid algorithm for nonlinear programming
• A new active-set strategy for NCP with degenerate solutions
• An active set strategy based on the multiplier function or the gradient.
• Algorithm of dividing ellipsoids: a method of solution of systems of nonconvex inequalities
• On the use of outer approximations as an external active set strategy
• Active set and interior methods for nonlinear optimization
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• An ellipsoid algorithm for equality-constrained nonlinear programs
• scientific article; zbMATH DE number 6907388 (Why is no real title available?)
• A cutting-plane method to nonsmooth multiobjective optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433159)