A numerically stable dual method for solving strictly convex quadratic programs
From MaRDI portal
Publication:59165
DOI10.1007/bf02591962zbMath0537.90081WikidataQ94872283 ScholiaQ94872283MaRDI QIDQ59165
D. Goldfarb, A. Idnani, Donald Goldfarb, Ashok Udhawdas Idnani
Publication date: September 1983
Published in: Mathematical Programming (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C20: Quadratic programming
90C55: Methods of successive quadratic programming type
Related Items
Solving nonlinear programming problems with very many constraints, Time-discretized variational formulation of non-smooth frictional contact, Unnamed Item, Optimal control of radiating panels via sequential quadratic programming, A column generation method for inverse shortest path problems, Unnamed Item, INTERVAL PIECEWISE REGRESSION MODEL WITH AUTOMATIC CHANGE-POINT DETECTION BY QUADRATIC PROGRAMMING, Local dependence estimation using semiparametric archimedean copulas, Conservative discretization of contact/impact problems for nearly rigid bodies, Positive numerical integration methods for chemical kinetic systems, CMLS, qpmadr, Updating of conjugate direction matrices using members of Broyden's family, The sagitta method for solving linear programs, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, On an instance of the inverse shortest paths problem, 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 cutting plane method for solving minimax problems in the complex plane, A general method for calculating functions of fuzzy numbers, A new penalty function algorithm for convex quadratic programming, Reducing bias in curve estimation by use of weights., A new technique for inconsistent QP problems in the SQP method, MERLIN-3. 0. A multidimensional optimization environment, Orthogonal and conjugate basis methods for solving equality constrained minimization problems, Resolving degeneracy in quadratic programming, A strictly improving linear programming Phase I algorithm, On the use of an inverse shortest paths algorithm for recovering linearly correlated costs, Local convergence analysis for the REQP algorithm using conjugate basis matrices, Discretization methods for the solution of semi-infinite programming problems, Block-iterative surrogate projection methods for convex feasibility problems, A general projection framework for constrained smoothing., An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, ABS algorithms for linear equations and optimization, Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity, Randomized algorithms for the separation of point sets and for solving quadratic programs, Finite element analysis of nonsmooth contact, Application of the dual active set algorithm to quadratic network optimization, Unnamed Item
