scientific article

zbMath1160.90639MaRDI QIDQ2768040

Oustry, François, Claude Lemaréchal

Publication date: 30 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on nonlinear programming (49M37) Combinatorial optimization (90C27)

Related Items

Dantzig-Wolfe reformulations for binary quadratic problems, Using the eigenvalue relaxation for binary least-squares estimation problems, A note on computing the smallest conic singular value, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Partial Lagrangian relaxation for general quadratic programming, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, An improved lower bound and approximation algorithm for binary constrained quadratic programming problem, Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, A majorization-minimization approach to the sparse generalized eigenvalue problem, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Unbounded convex sets for non-convex mixed-integer quadratic programming, Improved semidefinite bounding procedure for solving max-cut problems to optimality, On duality gap in binary quadratic programming, Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints, A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs, The spherical constraint in Boolean quadratic programs, Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection, A guide to conic optimisation and its applications, A New Approach to the Stable Set Problem Based on Ellipsoids, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, The MIN-cut and vertex separator problem, Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring, Convex reformulation for binary quadratic programming problems via average objective value maximization, The omnipresence of Lagrange, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation