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