A semismooth newton method for generalized semi-infinite programming problems

Download

index.pdf

Date

2010

Author

Tezel Özturan, Aysun

Metadata

Show full item record

Item Usage Stats

199
views

100
downloads

Semi-infinite programming problems is a class of optimization problems in finite dimensional variables which are subject to infinitely many inequality constraints. If the infinite index of inequality constraints depends on the decision variable, then the problem is called generalized semi-infinite programming problem (GSIP). If the infinite index set is fixed, then the problem is called standard semi-infinite programming problem (SIP). In this thesis, convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems is investigated. In this method, using nonlinear complementarity problem functions the upper and lower level Karush-Kuhn-Tucker conditions of the optimization problem are reformulated as a semismooth system of equations. A possible violation of strict complementary slackness causes nonsmoothness. In this study, we show that the standard regularity condition for convergence of the semismooth Newton method is satisfied under natural assumptions for semi-infinite programs. In fact, under the Reduction Ansatz in the lower level problem and strong stability in the reduced upper level problem this regularity condition is satisfied. In particular, we do not have to assume strict complementary slackness in the upper level. Furthermore, in this thesis we neither assume strict complementary slackness in the upper nor in the lower level. In the case of violation of strict complementary slackness in the lower level, the auxiliary functions of the locally reduced problem are not necessarily twice continuously differentiable. But still, we can show that a standard regularity condition for quadratic convergence of the semismooth Newton method holds under a natural assumption for semi-infinite programs. Numerical examples from, among others, design centering and robust optimization illustrate the performance of the method.

Subject Keywords

Mathematics.

URI

http://etd.lib.metu.edu.tr/upload/3/12612130/index.pdf
https://hdl.handle.net/11511/19776

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A ROBUST ITERATIVE SCHEME FOR SYMMETRIC INDEFINITE SYSTEMS Manguoğlu, Murat (Society for Industrial & Applied Mathematics (SIAM), 2019-01-01) We propose a two-level nested preconditioned iterative scheme for solving sparse linear systems of equations in which the coefficient matrix is symmetric and indefinite with a relatively small number of negative eigenvalues. The proposed scheme consists of an outer minimum residual (MINRES) iteration, preconditioned by an inner conjugate gradient (CG) iteration in which CG can be further preconditioned. The robustness of the proposed scheme is illustrated by solving indefinite linear systems that arise in t...
A singularly perturbed differential equation with piecewise constant argument of generalized type Akhmet, Marat; Mirzakulova, Aziza (The Scientific and Technological Research Council of Turkey, 2018-01-01) The paper considers the extension of Tikhonov Theorem for singularly perturbed differential equation with piecewise constant argument of generalized type. An approximate solution of the problem has been obtained. A new phenomenon of humping has been observed in the boundary layer area. An illustrative example with simulations is provided.
Noncomplex smooth 4-manifolds with Lefschetz fibrations Korkmaz, Mustafa (2001-01-01) For every integer g ≥ 2 there exist infinitely many pairwise nonhomeomorphic smooth 4-manifolds admitting genus-g Lefschetz fibration over S2 but not carrying any complex structure. This extends a recent result of Ozbagci and Stipsicz.
A model for the computation of quantum billiards with arbitrary shapes Erhan, Inci M.; Taşeli, Hasan (Elsevier BV, 2006-10-01) An expansion method for the stationary Schrodinger equation of a three-dimensional quantum billiard system whose boundary is defined by an arbitrary analytic function is introduced. The method is based on a coordinate transformation and an expansion in spherical harmonics. The effectiveness is verified and confirmed by a numerical example, which is a billiard system depending on a parameter.
A generalisation of a theorem of Koldunov with an elementary proof Ercan, Z (Institute of Mathematics, Czech Academy of Sciences, 1999-01-01) We generalize a Theorem of Koldunov [2] and prove that a disjointness preserving quasi-linear operator between Resz spaces has the Hammerstein property.

Citation Formats

A. Tezel Özturan, “A semismooth newton method for generalized semi-infinite programming problems,” Ph.D. - Doctoral Program, Middle East Technical University, 2010.