home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!howland.reston.ans.net!usc!usc!not-for-mail
- From: wang@nyquist.usc.edu (Weizheng Wang)
- Newsgroups: sci.engr.control
- Subject: Re: Absolute minima theorems
- Date: 11 Jan 1993 14:53:25 -0800
- Organization: University of Southern California, Los Angeles, CA
- Lines: 37
- Message-ID: <1istp5INNkcq@nyquist.usc.edu>
- References: <1993Jan8.140544.25242@noao.edu>
- NNTP-Posting-Host: nyquist.usc.edu
-
- In article <1993Jan8.140544.25242@noao.edu> nroddier@noao.edu (Nicolas Roddier) writes:
- >Hello control people!
- >
- > I'm looking for some theorems that would garantee that an
- > optimization is an absolute minimum. E-L methods give some
- > necessary conditions for an optimzation to be an extremum.
- > How about some sufficient conditions for being the absolute
- > minimum.
- >
- > Thanks for any help.
- >
- > Nick.
- >
- >----------
- >nroddier@noao.edu
- >
- If you try to find minimization in a bounded region, I recommend Branch and
- Bound method. This method has been introduced to calculate robust control
- problems recently. It is believed that the method can be used to solve
- non-convex optimization problems. Here are a few references:
-
- R.R.E.de Gaston and M.G.Safonov, 1988, Exact calculation of the multiloop
- stability margine, IEEE trans. AC-33, pp.156-171
- A.Sederis and R.S.Sanches Pena, 1990, Robustness magin calculation with dynamic
- and real parametric uncertainty, IEEE trans AC-35, pp.970-974.
- V.Balakrishnan, S.Boyd and S.Balemi, 1991, Branch and bound algorithm for
- computing the minimum stability degree of parameter dependent linear systems,
- Int. J. Robust and Nonlinear Control. Vol.1, pp295-317.
- M.P.Newlin and P.M.Young, 1992, Mixed mu problems and branch and bound
- techniques, Proceedings of 31st CDC, pp.3175-3180
-
- ...and the references therein.
-
- W.Wang
-
-
-
-