Numerically stable methods for quadratic programming
From MaRDI portal
Publication:4152038
DOI10.1007/BF01588976zbMath0374.90054MaRDI QIDQ4152038
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
On the superlinear convergence of a trust region algorithm for nonsmooth optimization, Sparse quadratic programming in chemical process optimization, An active-set algorithm for norm constrained quadratic problems, Experiments with successive quadratic programming algorithms, Parallel multisplitting methods with optimal weighting matrices for linear systems, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, Primal and dual active-set methods for convex quadratic programming, A regularized decomposition method for minimizing a sum of polyhedral functions, FUZZY MULTIPLE OBJECTIVE PROGRAMMING IN AN INTERVAL PIECEWISE REGRESSION MODEL, An analytical formula for ring artefact suppression in X-ray tomography, ImplementableL∞penalty-function method for semi-infinite optimization, Exact QR factorizations of rectangular matrices, A computational method for the indefinite quadratic programming problem, A linearly distributed lag estimator with \(r\)-convex coefficients, INTERVAL PIECEWISE REGRESSION MODEL WITH AUTOMATIC CHANGE-POINT DETECTION BY QUADRATIC PROGRAMMING, Avoiding Modified Matrix Factorizations in Newton-like Methods, Solution of projection problems over polytopes, A parallel quadratic programming method for dynamic optimization problems, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems, Computation of a trust region step, A numerically stable dual method for solving strictly convex quadratic programs, 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, The computation of Lagrange-multiplier estimates for constrained minimization, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, A direct active set algorithm for large sparse quadratic programs with simple bounds, Optimization over the efficient set using an active constraint approach, A practical anti-cycling procedure for linearly constrained optimization, On the numerical realization of the exact penalty method for quadratic programming algorithms, On solving a primal geometric program by partial dual optimization, An SQP method for general nonlinear programs using only equality constrained subproblems, ON THE CONSISTENCY OF REGRESSION‐BASED MONTE CARLO METHODS FOR PRICING BERMUDAN OPTIONS IN CASE OF ESTIMATED FINANCIAL MODELS, A new technique for inconsistent QP problems in the SQP method, An algorithm for composite nonsmooth optimization problems, Solving the minimal least squares problem subject to bounds on the variables, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- The computation of Lagrange-multiplier estimates for constrained minimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Methods for Modifying Matrix Factorizations
- Constrained Optimization Using a Nondifferentiable Penalty Function
