Pages that link to "Item:Q1196182"

The following pages link to On affine scaling algorithms for nonconvex quadratic programming (Q1196182):

Displaying 35 items.

• A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems (Q489124) (← links)
• A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
• A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
• Tilt stability for quadratic programs with one or two quadratic inequality constraints (Q778159) (← links)
• An extension of interior point potential reduction algorithm to solve general lcps (Q835795) (← links)
• Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
• Global optimization by canonical dual function (Q964977) (← links)
• Solution to an optimal control problem via canonical dual method (Q983361) (← 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)
• A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
• Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← links)
• Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
• A geometric analysis of phase retrieval (Q1785008) (← 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)
• A trust region affine scaling method for bound constrained optimization (Q1942658) (← links)
• Convexity of quadratic transformations and its use in control and optimization (Q1969525) (← links)
• Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
• Fast semi-supervised evidential clustering (Q2237175) (← links)
• Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (Q2330643) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
• Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints (Q2693648) (← links)
• An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
• High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (Q5060495) (← links)
• A splitting method for quadratic programming problem (Q5949529) (← links)
• A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)