Reformulation in mathematical programming: An application to quantum chemistry

DOI10.1016/j.dam.2007.08.044zbMath1173.90494OpenAlexW2023374550WikidataQ62562204 ScholiaQ62562204MaRDI QIDQ1025997

Leo Liberti, Marco Antonio Chaer Nascimento, Nelson F. Maculan, Carlile C. Lavor

Publication date: 23 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.044

zbMATH Keywords

global optimizationbranch-and-boundHartree-Fock

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Disjunctive Cuts for Nonconvex MINLP, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Deterministic global optimization in ab-initio quantum chemistry, A mathematical programming formulation for the Hartree-Fock problem on open-shell systems, A framework for globally optimizing mixed-integer signomial programs, On convex relaxations of quadrilinear terms, Reformulations in Mathematical Programming: Definitions and Systematics, Conflict Analysis for MINLP

Uses Software

• SNOPT
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• A new reformulation-linearization technique for bilinear programming problems
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
• Application of deterministic low-discrepancy sequences in global optimization
• Linearity embedded in nonconvex programs
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Reduction constraints for the global optimization of NLPs
• Global optimization