On the complexity of approximating a KKT point of quadratic programming
From MaRDI portal
Recommendations
Cites work
- A continuous approach to inductive inference
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- A method for the solution of certain non-linear problems in least squares
- A new polynomial-time algorithm for linear programming
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Checking local optimality in constrained quadratic programming is NP- hard
- Combining binary search and Newton's method to compute real roots for a class of real functions
- Complementary pivot theory of mathematical programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computing Optimal Locally Constrained Steps
- Constrained global optimization: algorithms and applications
- How easy is local search?
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1203224 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Introduction to global optimization
- Newton’s Method with a Model Trust Region Modification
- On affine scaling algorithms for nonconvex quadratic programming
- Some NP-complete problems in quadratic and nonlinear programming
- The complexity of approximating a nonlinear program
Cited in
(25)- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model
- Accelerated methods for nonconvex optimization
- High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- A note on the complexity of \(L _{p }\) minimization
- Quasi-orthogonalization for alternating non-negative tensor factorization
- A FPTAS for computing a symmetric leontief competitive economy equilibrium
- The complexity of computing KKT solutions of quadratic programs
- Global approximation of local optimality: nonsubmodular optimization
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
- Non-submodular optimization and non-convex relaxation
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Newton-KKT interior-point methods for indefinite quadratic programming
This page was built for publication: On the complexity of approximating a KKT point of quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380927)
