Solving quadratically constrained convex optimization problems with an interior-point method
From MaRDI portal
Recommendations
- The Bpmpd interior point solver for convex quadratically constrained quadratic programming problems
- A stable interior point method for convex quadratic programming
- On implementing a primal-dual interior-point method for conic quadratic optimization
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- An interior point method for general large-scale quadratic programming problems
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Computational experience with a primal-dual interior point method for linear programming
- Computing the Minimum Fill-In is NP-Complete
- Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
- Fast Cholesky factorization for interior point methods of linear programming
- On Numerical Issues of Interior Point Methods
- Sparsity in convex quadratic programming with interior point methods
- Symmetric Quasidefinite Matrices
- The BPMPD interior point solver for convex quadratic problems
- The Cholesky factorization in interior point methods
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Cited in
(14)- Using interior point solvers for optimizing progressive lens models with spherical coordinates
- An interior point method for quadratic programs based on conjugate projected gradients
- The BPMPD interior point solver for convex quadratic problems
- The practical behavior of the homogeneous self-dual formulations in interior point methods
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- An interior point method and Sherman-Morrison formula for solving large scale convex quadratic problems with diagonal Hessians
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- scientific article; zbMATH DE number 847150 (Why is no real title available?)
- Solving conic quadratically constrained quadratic programming problems
- A non-interior path following method for convex quadratic programming problems with bound constraints
- The Bpmpd interior point solver for convex quadratically constrained quadratic programming problems
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
This page was built for publication: Solving quadratically constrained convex optimization problems with an interior-point method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093053)
