Pages that link to "Item:Q1196182"
From MaRDI portal
The following pages link to On affine scaling algorithms for nonconvex quadratic programming (Q1196182):
Displayed 16 items.
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- A study on concave optimization via canonical dual function (Q1002175) (← links)
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
- On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
- A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Penalty parameter for linearly constrained 0--1 quadratic programming (Q1411397) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← links)
- Hidden convexity in some nonconvex quadratically constrained quadratic programming (Q1919813) (← links)
- Convexity of quadratic transformations and its use in control and optimization (Q1969525) (← links)
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
- A splitting method for quadratic programming problem (Q5949529) (← links)