Optimality conditions for maximizing a function over a polyhedron

DOI10.1007/s10107-013-0644-1zbMath1298.90127OpenAlexW2119766865MaRDI QIDQ2248749

James T. Hungerford, William W. Hager

Publication date: 27 June 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0644-1

zbMATH Keywords

quadratic programmingoptimality conditionsgraph partitioningvertex separatorcritical coneedge-convexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Related Items

Continuous quadratic programming formulations of optimization problems on graphs, A General Regularized Continuous Formulation for the Maximum Clique Problem, A multilevel bilinear programming algorithm for the vertex separator problem, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of convex polyhedra
• Edge-directions of standard polyhedra with applications to network flows
• Linear and nonlinear programming.
• Checking local optimality in constrained quadratic programming is NP- hard
• Une caractérisation complete des minima locaux en programmation quadratique
• Convex combinatorial optimization
• On the equivalence between some discrete and continuous optimization problems
• Some NP-complete problems in quadratic and nonlinear programming
• Numerical Optimization
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Graph Partitioning and Continuous Quadratic Programming
• Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
• Necessary and sufficient conditions for quadratic minimality