ZQPCVX

swMATH8459MaRDI QIDQ20468

No author found.

Related Items (34)

Newton projection method as applied to assembly simulation ⋮ QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming ⋮ On the quadratic programming algorithm of Goldfarb and Idnani ⋮ Experiments with successive quadratic programming algorithms ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation ⋮ Nonlinear analysis of shear deformable beam-columns partially supported on tensionless three-parameter foundation ⋮ New variants of bundle methods ⋮ A factorization with update procedures for a KKT matrix arising in direct optimal control ⋮ A numerically stable least squares solution to the quadratic programming problem ⋮ Solving nonlinear programming problems with very many constraints ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ Updating conjugate directions by the BFGS formula ⋮ Two-point mid-range approximation enhanced recursive quadratic programming method ⋮ A note on an implementation of a method for quadratic semi-infinite programming ⋮ A linearly distributed lag estimator with \(r\)-convex coefficients ⋮ Convex optimization techniques in compliant assembly simulation ⋮ On an instance of the inverse shortest paths problem ⋮ Algorithm 742: L2CXFT ⋮ Several multi-criteria programming methods for classification ⋮ A bundle-filter method for nonsmooth convex constrained optimization ⋮ Bayesian analysis of binary sequences ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ Design of cross-directional controllers with optimal steady state performance ⋮ An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints ⋮ Solving semidefinite quadratic problems within nonsmooth optimization algorithms ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ Orthogonal and conjugate basis methods for solving equality constrained minimization problems ⋮ Resolving degeneracy in quadratic programming ⋮ Minimization of quadratic functionals on cones in Hilbert spaces ⋮ Local convergence analysis for the REQP algorithm using conjugate basis matrices ⋮ Methods for convex and general quadratic programming

This page was built for software: ZQPCVX