A General Quadratic Programming Algorithm
From MaRDI portal
Publication:5633838
DOI10.1093/imamat/7.1.76zbMath0226.90036OpenAlexW2127982942MaRDI QIDQ5633838
Publication date: 1971
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/7.1.76
Related Items
Primal and dual active-set methods for convex quadratic programming, Nonlinear coordinate representations of smooth optimization problems, Projected gradient algorithms for optimization over order simplices, Учет геолого-технических мероприятий при моделировании разработки нефтяной залежи методом материального баланса, Degenerate values for Broyden methods, PAL-Hom method for QP and an application to LP, An algorithm for solving linearly constrained optimization problems, A canonical dual approach for solving linearly constrained quadratic programs, A hybrid approach for index tracking with practical constraints, Solution of projection problems over polytopes, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, A numerically stable dual method for solving strictly convex quadratic programs, Two-stage estimation of inequality-constrained marginal linear models with longitudinal data, A weighted gram-schmidt method for convex quadratic programming, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, Equivalence of some quadratic programming algorithms, An accelerated multiplier method for nonlinear programming, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, An equivalence between two algorithms for general quadratic programming, A direct active set algorithm for large sparse quadratic programs with simple bounds, A combined conjugate-gradient quasi-Newton minimization algorithm, A computational study of active set strategies in nonlinear programming with linear constraints, Integer quadratic optimization, A new penalty function algorithm for convex quadratic programming, An algorithm for least distance programming, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems, Optimal control computation for linear time-lag systems with linear terminal constraints, A semi-Lagrangian mixed finite element method for advection-diffusion variational inequalities, Interior-point algorithms for global optimization, Constraint deletion strategy in the inertia-controlling quadratic programming method, Methods for convex and general quadratic programming, A method to increase the computational efficiency of certain quadratic programming algorithms
