2026-09-19T10:30:04Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/417322022-01-13T07:54:53Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Paul I. Barton.
Kumar, Vinay, S.M. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Massachusetts Institute of Technology. Computation for Design and Optimization Program
2008-05-19T16:12:57Z
2008-05-19T16:12:57Z
2007
2007
http://hdl.handle.net/1721.1/41732
225090570
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.
Includes bibliographical references (p. 93-94).
A new approach is proposed for finding all solutions of systems of nonlinear equations with bound constraints. The zero finding problem is converted to a global optimization problem whose global minima with zero objective value, if any, correspond to all solutions of the initial problem. A branch-and-bound algorithm is used with McCormick's nonsmooth convex relaxations to generate lower bounds. An inclusion relation between the solution set of the relaxed problem and that of the original non-convex problem is established which motivates a method to generate automatically reasonably close starting points for a local Newton-type method. A damped-Newton method with natural level functions employing the restrictive monotonicity test is employed to find solutions robustly and rapidly. Due to the special structure of the objective function, the solution of the convex lower bounding problem yields a nonsmooth root exclusion test which is found to perform better than earlier interval based exclusion tests. The Krawczyk operator based root inclusion and exclusion tests are also embedded in the proposed algorithm to refine the variable bounds for efficient fathoming of the search space. The performance of the algorithm on a variety of test problems from the literature is presented and for most of them the first solution is found at the first iteration of the algorithm due to the good starting point generation.
by Vinay Kumar.
S.M.
94 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Computation for Design and Optimization Program.
A nonsmooth exclusion test for finding all solutions of nonlinear equations
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6f957aa1-d147-4e12-bd6d-1c76d85756d2">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A nonsmooth exclusion test for finding all solutions of nonlinear equations</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2007</PublicationDate>
<Authors>
<Author>
<DisplayName>Kumar, Vinay, S.M. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Computation for Design and Optimization Program.</Keyword>
<Abstract>A new approach is proposed for finding all solutions of systems of nonlinear equations with bound constraints. The zero finding problem is converted to a global optimization problem whose global minima with zero objective value, if any, correspond to all solutions of the initial problem. A branch-and-bound algorithm is used with McCormick's nonsmooth convex relaxations to generate lower bounds. An inclusion relation between the solution set of the relaxed problem and that of the original non-convex problem is established which motivates a method to generate automatically reasonably close starting points for a local Newton-type method. A damped-Newton method with natural level functions employing the restrictive monotonicity test is employed to find solutions robustly and rapidly. Due to the special structure of the objective function, the solution of the convex lower bounding problem yields a nonsmooth root exclusion test which is found to perform better than earlier interval based exclusion tests. The Krawczyk operator based root inclusion and exclusion tests are also embedded in the proposed algorithm to refine the variable bounds for efficient fathoming of the search space. The performance of the algorithm on a variety of test problems from the literature is presented and for most of them the first solution is found at the first iteration of the algorithm due to the good starting point generation.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>