Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods

DOI10.2478/v10006-007-0043-yzbMath1234.90022MaRDI QIDQ3089761

Jacek Błaszczyk, Andrzej Karbowski, Krzysztof Malinowski

Publication date: 25 August 2011

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207856

zbMATH Keywords

large-scale optimization; automatic differentiation; performance data analysis; object-oriented numerical computations

Mathematics Subject Classification ID

68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)

90C51: Interior-point methods

90C39: Dynamic programming

90C55: Methods of successive quadratic programming type

90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming

Related Items

A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem, Optimization-based approach to path planning for closed chain robot systems, Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs, A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory, Sensitivity of computer support game algorithms of safe ship control

Uses Software

• ADOL-C
• KNITRO
• ipfilter
• Ipopt
• HQP/OMUSES
• CG+
• HQP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• Computational aspects of discrete-time optimal control
• A new polynomial-time algorithm for linear programming
• Nonlinear programming codes. Information, tests, performance
• An interior-point algorithm for nonconvex nonlinear programming
• Interior point methods for optimal control of discrete time systems
• Two methods for large-scale nonlinear optimization and their comparison on a case study of hydropower optimization
• Family of projected descent methods for optimization problems with simple bounds
• Failure of global convergence for a class of interior point methods for nonlinear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
• Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming
• A globally convergent primal-dual interior-point filter method for nonlinear programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• On Mehrotra-Type Predictor-Corrector Algorithms
• On the quadratic programming algorithm of Goldfarb and Idnani
• Differential dynamic programming and Newton's method
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• On the Implementation of a Primal-Dual Interior Point Method
• Numerical Optimization
• A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• Projected Newton Methods for Optimization Problems with Simple Constraints
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• A trust region method based on interior point techniques for nonlinear programming.
• Benchmarking optimization software with performance profiles.
• Nonlinear programming without a penalty function.