Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
The reduction principle for systems with piecewise constant argument
Date
2011-01-01
Author
Akhmet, Marat
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
30
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/99250
Journal
NONLINEAR HYBRID CONTINUOUS/DISCRETE-TIME MODELS
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
THE SEMISMOOTH APPROACH FOR SEMI-INFINITE PROGRAMMING WITHOUT STRICT COMPLEMENTARITY
Stein, Oliver; Tezel, Aysun (Society for Industrial & Applied Mathematics (SIAM), 2009-01-01)
As a complement of our recent article [O. Stein and A. Tezel, J. Global Optim., 41 (2008), pp. 245-266], we study convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems. The semismooth Newton method is applied to a semismooth reformulation of the upper and lower level Karush-Kuhn-Tucker conditions by nonlinear complementarity problem functions into a semismooth system of equations. In the present paper we assume strict complementary slac...
The semismooth approach for semi-infinite programming under the Reduction Ansatz
Stein, Oliver; Tezel, Aysun (Springer Science and Business Media LLC, 2008-06-01)
We study convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems where, using NCP functions, the upper and lower level Karush-Kuhn-Tucker conditions of the optimization problem are reformulated as a semismooth system of equations. Nonsmoothness is caused by a possible violation of strict complementarity slackness. We show that the standard regularity condition for convergence of the semismooth Newton method is satisfied under natural assu...
The classical involution theorem for groups of finite Morley rank
Berkman, A (Elsevier BV, 2001-09-15)
This paper gives a partial answer to the Cherlin-Zil'ber Conjecture, which states that every infinite simple group of finite Morley rank is isomorphic to an algebraic group over an algebraically closed field. The classification of the generic case of tame groups of odd type follows from the main result of this work, which is an analogue of Aschbacher's Classical Involution Theorem for finite simple groups. (C) 2001 Academic Press.
The confined system approximation for solving non-separable potentials in three dimensions
Taşeli, Hasan (1998-04-01)
The Hilbert space L-2(R-3), to which the wavefunction of the three-dimensional Schrodinger equation belongs, has been replaced by L-2(Omega), where Omega is a bounded region. The energy spectrum of the usual unbounded system is then determined by showing that the Dirichlet and Neumann problems in L-2(Omega) generate upper and lower bounds, respectively, to the eigenvalues required. Highly accurate numerical results for the quartic and sextic oscillators are presented for a wide range of the coupling constants.
The Laguerre pseudospectral method for the reflection symmetric Hamiltonians on the real line
Taşeli, Hasan (Springer Science and Business Media LLC, 2007-05-01)
Hermite-Weber functions provide a natural expansion basis for the numerical treatment of the Schrodinger equation on the whole real line. For the reflection symmetric Hamiltonians, however, it is shown here that the transformation of the problem over the half line and use of a Laguerre basis is computationally much more efficient in a pseudospectral scheme.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Akhmet, “The reduction principle for systems with piecewise constant argument,”
NONLINEAR HYBRID CONTINUOUS/DISCRETE-TIME MODELS
, vol. 8, pp. 33–48, 2011, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/99250.