User guide for QPOPT: Fortran package for constrained linear least-squares and convex quadratic programming. QPOPT is a set of Fortran 77 subroutines for minimizing a general quadratic function subject to linear constraints and simple upper and lower bounds. QPOPT may also be used for linear programming and for finding a feasible point for a set of linear equalities and inequalities. If the quadratic function is convex (i.e., the Hessian is positive definite or positive semidefinite), the solution obtained will be a global minimizer. If the quadratic is non-convex (i.e., the Hessian is indefinite), the solution obtained will be a local minimizer or a dead-point. A two-phase active-set method is used. The first phase minimizes the sum of infeasibilities. The second phase minimizes the quadratic function within the feasible region, using a reduced Hessian to obtain search directions. The method is most efficient when many constraints or bounds are active at the solution. QPOPT is not intended for large sparse problems, but there is no fixed limit on problem size.

References in zbMATH (referenced in 11 articles )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Forsgren, Anders; Gill, Philip E.; Wong, Elizabeth: Primal and dual active-set methods for convex quadratic programming (2016)
  2. Mommer, Mario S.; Sommer, Andreas; Schlöder, Johannes P.; Bock, H.Georg: A nonlinear preconditioner for optimum experimental design problems (2015)
  3. Kirches, Christian: Fast numerical methods for mixed-integer nonlinear model-predictive control (2011)
  4. Kirches, Christian; Bock, Hans Georg; Schlöder, Johannes P.; Sager, Sebastian: Block-structured quadratic programming for the direct multiple shooting method for optimal control (2011)
  5. Kirches, Christian; Bock, Hans Georg; Schlöder, Johannes P.; Sager, Sebastian: A factorization with update procedures for a KKT matrix arising in direct optimal control (2011)
  6. Gould, Nicholas I.M.; Robinson, Daniel P.: A second derivative SQP method: global convergence (2010)
  7. Potschka, Andreas; Bock, Hans Georg; Schlöder, Johannes P.: A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems (2009)
  8. Bartlett, Roscoe A.; Biegler, Lorenz T.: QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming (2006)
  9. Oh, Seyoung; Yun, Jae Heon; Chung, Sei-Young: A quadratic approximation for protein sequence to structure mapping. (2003)
  10. Lawrence, Craig T.; Tits, André L.: A computationally efficient feasible sequential quadratic programming algorithm (2001)
  11. Park, Hyungju; Michelena, Nestor; Kulkarni, Devadatta; Papalambros, Panos: Convergence criteria for hierarchical overlapping coordination of linearly constrained convex design problems (2001)