Complete solutions to general box-constrained global optimization problems
Summary: This paper presents a global optimization method for solving general nonlinear programming problems subjected to box constraints. Regardless of convexity or nonconvexity, by introducing a differential flow on the dual feasible space, a set of complete solutions to the original problem is obtained, and criteria for global optimality and existence of solutions are given. Our theorems improve and generalize recent known results in the canonical duality theory. Applications to a class of constrained optimal control problems are discussed. Particularly, an analytical form of the optimal control is expressed. Some examples are included to illustrate this new approach.
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems
- Canonical duality for solving general nonconvex constrained problems
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Canonical dual approach to solving 0-1 quadratic programming problems
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Convex Analysis
- Duality principles in nonconvex systems. Theory, methods and applications
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Extension theory of differential operators I
- Global extremal conditions for multi-integer quadratic programming
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 2156462 (Why is no real title available?)
- scientific article; zbMATH DE number 918596 (Why is no real title available?)
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Solutions to quadratic minimization problems with box and integer constraints
- The linear-Quadratic Control Problem: Some Recent Results and Outstanding Problems
- A general solution to least squares problems with box constraints and its applications
- The reformulation of nonlinear complementarity problems using the Fischer-Burmeister function
- Modified ADMM algorithm for solving proximal bound formulation of multi-delay optimal control problem with bounded control
- Generating box-constrained optimization problems
This page was built for publication: Complete solutions to general box-constrained global optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642768)