Reverse bridge theorem under constraint partition
Summary: Reverse bridge theorem (RBTH) has been proved to be both a necessary and sufficient condition for solving Nonlinear programming problems. In this paper, we first propose three algorithms for finding constraint minimum points of continuous, discrete, and mixed-integer nonlinear programming problems based on the reverse bridge theorem. Moreover, we prove that RBTH under constraint partition is also a necessary and sufficient condition for solving nonlinear programming problems. This property can help us to develop an algorithm using RBTH under constraints. Specifically, the algorithm first partitions mixed-integer nonlinear programming problems (MINLPs) by their constraints into some subproblems in similar forms, then solves each subproblem by using RBTH directly, and finally resolves those unsatisfied global constraints by choosing appropriate penalties. Finally, we prove the soundness and completeness of our algorithm. Experimental results also show that our algorithm is effective and sound.
- A reversal of Schur's partition theorem
- Effective method for constrained minimum - reverse bridge theorem
- Bridge decomposition of restriction measures
- scientific article; zbMATH DE number 4033544
- The Partitionability Conjecture
- scientific article; zbMATH DE number 2143741
- A reverse Denjoy theorem
- scientific article; zbMATH DE number 2038186
- Reverse Mathematics of Separation Theorems in Lattice Theory
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Constraint partitioning in penalty formulations for solving temporal planning problems
- CUTE
- Decomposition Principle for Linear Programs
- Effective method for constrained minimum - reverse bridge theorem
- Generalized Lagrange Multipliers in Integer Programming
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1487974 (Why is no real title available?)
- Nonlinear programming without a penalty function.
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
- Temporal planning using subgoal partitioning and resolution in SGPlan
This page was built for publication: Reverse bridge theorem under constraint partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1958870)
