This work reveals solutions for quadratic minimization and maximization problems, suggesting new approaches to optimization.
We consider a quadratic minimization problem with both fixed endpoints and its associated maximization problem from a viewpoint of complementarity. We show that a complementary identity with an elementary inequality generates a pair of dn _ 1T-variable minimization problem (primal) and dn t 1T-variable maximization one (dual). The identity produces an equality condition, which is a linear system of 2n-equation on 2n-variable. The condition splits into a pair of linear systems of dn _ 1T-equation on dn _ 1T-variable and of dn t 1T-equation on dn t 1T-variable. The former solves the primal, while the latter does the dual. Both the optimal solutions are characterized by the Fibonacci sequence. The solutions are also given through dynamic programming.
No takes yet. Share an insight, caveat, or question.
Iwamoto et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: