Pages that link to "Item:Q1915920"
From MaRDI portal
The following pages link to An interior point method for general large-scale quadratic programming problems (Q1915920):
Displaying 13 items.
- A generalized computing paradigm based on artificial dynamic models for mathematical programming (Q894649) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- An interior Newton method for quadratic programming (Q1586205) (← links)
- Sequential quadratic programming for large-scale nonlinear optimization (Q1593815) (← links)
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization (Q1681794) (← links)
- An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
- Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
- Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
- Joint optimization of pricing and planning decisions in divergent supply chain (Q2865167) (← links)
- Solving quadratically constrained convex optimization problems with an interior-point method (Q3093053) (← links)
- The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
- (Q4654839) (← links)
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming (Q5503697) (← links)
