Object-oriented software for quadratic programming
From MaRDI portal
Numerical algorithms for specific classes of architectures (65Y10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Quadratic programming (90C20)
Recommendations
- LOQO:an interior point code for quadratic programming
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- QPLIB: a library of quadratic programming instances
- qpOASES: a parametric active-set algorithm for~quadratic programming
- scientific article; zbMATH DE number 2143190
Cited in
(50)- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- OOQP
- Lifted collocation integrators for direct optimal control in ACADO toolkit
- A homogeneous model for monotone mixed horizontal linear complementarity problems
- CasADi: a software framework for nonlinear optimization and optimal control
- A primal-dual regularized interior-point method for convex quadratic programs
- A starting point strategy for nonlinear interior methods.
- Design and implementation of a modular interior-point solver for linear optimization
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- Learning to steer nonlinear interior-point methods
- Exploiting structure in parallel implementation of interior point methods for optimization
- QPLIB: a library of quadratic programming instances
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- On parallelizing dual decomposition in stochastic integer programming
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Monotonicity preserving approximation of multivariate scattered data
- A primal-dual interior-point algorithm for quadratic programming
- Two new decomposition algorithms for training bound-constrained support vector machines
- Benchmarking large-scale distributed convex quadratic programming algorithms
- A formulation of the linear discrete Coulomb friction problem via convex optimization
- A parallel decomposition algorithm for training multiclass kernel-based vector machines
- Optimal control of hybrid systems with sliding modes
- A factorization with update procedures for a KKT matrix arising in direct optimal control
- Interior point methods 25 years later
- A repository of convex quadratic programming problems
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- Direct optimal control and model predictive control
- scientific article; zbMATH DE number 2143190 (Why is no real title available?)
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- The parallel solution of dense saddle-point linear systems arising in stochastic programming
- The ESA NLP solver WORHP
- POINTWISE CONSTRUCTION OF LIPSCHITZ AGGREGATION OPERATORS WITH SPECIFIC PROPERTIES
- Exploiting separability in large-scale linear support vector machine training
- Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming
- Smoothing Lipschitz functions
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
- A Round Trip Time Weighting Model for One-way Delay Estimation
- Quadratic programming
- A massively parallel interior-point method for arrowhead linear programs with local linking structure
- OSQP: an operator splitting solver for quadratic programs
- Starting-point strategies for an infeasible potential reduction method
- Efficient robust optimization for robust control with constraints
This page was built for publication: Object-oriented software for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461049)
