𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Global optimization for the Biaffine Matrix Inequality problem

✍ Scribed by Keat-Choon Goh; Michael G. Safonov; George P. Papavassilopoulos

Publisher
Springer US
Year
1995
Tongue
English
Weight
834 KB
Volume
7
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterizing global optimality for DC
Characterizing global optimality for DC optimization problems under convex inequality constraints
✍ V. Jeyakumar; B. M. Glover πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 801 KB

Characterizations of global optimality are given for general difference convex (DC) optimization problems involving convex inequality constraints. These results are obtained in terms of E-subdifferentials of the objective and constraint functions and do not require any regularity condition. An exten

A new Lagrangian dual global optimizatio
A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities
✍ H. D. Tuan; P. Apkarian; Y. Nakashima πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 2 views

A new global optimization algorithm for solving bilinear matrix inequalities (BMI) problems is developed. It is based on a dual Lagrange formulation for computing lower bounds that are used in a branching procedure to eliminate partition sets in the space of complicating variables. The advantage of

The pth-order optimality conditions for
The pth-order optimality conditions for inequality constrained optimization problems
✍ O.A. Brezhneva; A.A. Tret’yakov πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 143 KB

In this paper, we present pth-order necessary conditions for optimality for an optimization problem with inequality constraints in the finite-dimensional spaces. Models of this type arise as the discretization of optimal control problems, calculus of variations problems, and other problems. The pape