Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions

Christopher Montez (), Sujeevraja Sanjeevi () and Kaarthik Sundar ()
Additional contact information
Christopher Montez: Texas A&M University, Department of Mechanical Engineering
Sujeevraja Sanjeevi: OpsLab
Kaarthik Sundar: Los Alamos National Laboratory, Information Systems & Modeling Group

Journal of Global Optimization, 2025, vol. 93, issue 3, No 1, 605-650

Abstract: Abstract This article presents the first mixed-integer linear programming (MILP)-based iterative algorithm to solve factorable mixed-integer nonlinear programs (MINLPs) with bounded, differentiable periodic functions to global optimality with an emphasis on trigonometric functions. At each iteration, the algorithm solves a MILP relaxation of the original MINLP to obtain a bound on the optimal objective value. The relaxations are constructed using partitions of variables involved in each nonlinear term and across successive iterations, the solution of the relaxations is used to refine these partitions further leading to tighter relaxations. Also, at each iteration, a heuristic/local solve on the MINLP is used to obtain a feasible solution to the MINLP. The iterative algorithm terminates till the optimality gap is sufficiently small. This article proposes novel refinement strategies that first choose a subset of variables whose domain is refined, refinement schemes that specify the manner in which the variable domains are refined, and MILP relaxations that exploit the principal domain of the periodic functions. We also show how solving the resulting MILP relaxation may be accelerated when two or more periodic functions are related by a linking constraint. This is especially useful as any periodic function may be approximated to arbitrary precision by a Fourier series. Finally, we examine the effectiveness of the proposed approach by solving a path planning problem for a single fixed-wing aerial vehicle and present extensive numerical results comparing the various refinement schemes and techniques.

Keywords: Global Optimization; MILP-based algorithms; Dubins vehicle; Robotics; Trigonometric Functions (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-025-01547-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:93:y:2025:i:3:d:10.1007_s10898-025-01547-9

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-025-01547-9

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().