Pages that link to "Item:Q885826"
From MaRDI portal
The following pages link to Newton-KKT interior-point methods for indefinite quadratic programming (Q885826):
Displaying 14 items.
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- Nonlinear optimization problem of interdependent investment projects portfolio (Q507118) (← links)
- Fitting curves and surfaces to point clouds in the presence of obstacles (Q625170) (← links)
- Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds (Q700699) (← links)
- On some interior-point algorithms for nonconvex quadratic optimization (Q1396211) (← links)
- An interior Newton method for quadratic programming (Q1586205) (← links)
- MINQ8: general definite and bound constrained indefinite quadratic programming (Q1744884) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
