Some NP-complete problems in quadratic and nonlinear programming

1987/06/01 by Katta G. Murty, Santosh N. Kabadi · 10 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Class (philosophy) #Combinatorics #Computer science #Corollary #Discrete mathematics #Formal Methods in Verification #Integer (computer science) #Integer programming #Mathematical optimization #Mathematics #Nonlinear programming #Nonlinear system #Optimization and Variational Analysis #Quadratic equation #Quadratic programming #Simple (philosophy)

paper · doi:10.1007/bf02592948

crossref issued 1987/06/01 · crossref published 1987/06/01 · crossref published-online 1987/06/01 · crossref published-print 1987/06/01 · openalex publication_date 1987/06/01 · crossref created 2007/03/29 · crossref deposited 2019/05/20 · openalex created_date 2025/10/10 · crossref indexed 2026/07/21 · openalex updated_date 2026/07/23

Cited by

• Vacuum stability of a general scalar potential of a few fields
• Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving
• Nonconvex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advances
• On the complexity of proximal gradient and proximal Newton-CG methods for \(ℓ₁\)-regularized Optimization
• Learning Filter Bank Sparsifying Transforms
• Scheduling for a processor sharing system with linear slowdown
• Piecewise Semi-Ellipsoidal Control Invariant Sets
• Lookahead: A Far-Sighted Alternative of Magnitude-based Pruning
• Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm
• Convex optimization [wikipedia]