The algorithm's objective is to efficiently solve Dynamic Linear Programs by taking advantage of their special staircase structure, which constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems.
For solving nonconvex equality-constrained optimization problems, a recent Gradient-Eigenstep Algorithm by Goyens et al.~is an iteration-efficient approach, based on minimizing Fletcher's augmented Lagrangian function, for finding an approximate second-order stationary point from an arbitrary starting point. In this pa...
F. Curtis, Ling-Jun Guo, Daniel P. Robinson· 0 citations
The ability to directly handle non-convex constraints and recast complex, nonlinear dynamics into formulations with reliable convergence properties makes the moment-SOS approach suitable for autonomous onboard applications.
Adam Evans, Alberto Fossà, R. Armellin et al.· arXiv.org· 0 citations
Abstract Refinery network optimization is a challenging Mixed-Integer Nonlinear Programming (MINLP) problem due to complex process interactions and non-linearities. This paper proposes a multi-period solution strategy that decomposes the original MINLP into a sequence of tractable sub-problems. First, all non-linear te...
M. Khalilipour, Mohammad Reza Sardashti Birjandi, F. Shahraki· Chemical product and process...· 0 citations
One of the peculiar features of multi-parametric approach for bilevel programs is that most methods using this approach can be extended to tri-level (and generally to $k$-level) programs, which is not always the case with other non-heuristic solution methods. However, most of existing multi-parametric methods work well...
The method introduces a structured loop-enumeration strategy within the transportation simplex framework that yields optimal solutions identical to classical methods and achieves comparable or improved performance on average runtime, with clearer benefits on medium-to-large instances where loop redundancy is more prono...
D. K. Boah, Suleman Abudu Fiele, C. J. Etwire· Discover Analytics· 0 citations
This work considers a quadratic minmax problem with coupled inner constraints and proposes a method to compute a class of stationary points and shows in particular that the method is polynomial in the special case where the inner feasible set of the authors' constrained minmax problem is independent from outer variable...
Stefano Cipolla, O. Stein, Alain B. Zemkoho· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
