Results 261 to 270 of about 16,521 (306)

Conditioning and Regularization of Nonsymmetric Operators

Journal of Optimization Theory and Applications, 1997
The authors introduce a measure of conditioning for a monotone operator, which depends on the strong monotonicity constant and the so-called Dunn constant. A notion of regularization with respect to some operator is defined. The last notion generalizes the classical Yosida regularization.
Renaud, A., Cohen, G.
openaire   +2 more sources

On the Image Regularity Condition

Journal of Optimization Theory and Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Pumping Condition for Regular Sets

SIAM Journal on Computing, 1997
Summary: We prove that a language of a finitely generated free monoid is regular if and only if it satisfies the positive block pumping property. This gives a positive answer to a problem posed by \textit{A. Ehrenfeucht, R. Parikh}, and \textit{G. Rozenberg} [SIAM J. Comput. 10, 536-541 (1981; Zbl 0461.68081 )].
openaire   +2 more sources

On the Regularity Condition for Vector Programming Problems

Journal of Global Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T. Amahroq, Nazih Abderrazzak Gadhi
openaire   +2 more sources

A Note on Matsushima's Regularity Condition

Journal of Economic Theory, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On a Condition of Almost Markov Regularity

Theory of Probability & Its Applications, 1984
Translation from Teor. Veroyatn. Primen. 28, No.2, 358-362 (Russian) (1983; Zbl 0513.60064).
openaire   +2 more sources

Regular Synthesis and Sufficiency Conditions for Optimality

SIAM Journal on Control and Optimization, 2000
The authors propose notions of ``regular presynthesis and synthesis''. The relation between the introduced concepts and the other definitions of synthesis is discussed. Moreover, several examples for optimal regular synthesis are presented in order to illustrate the differences between the various definitions. The main result is a sufficiency condition
Benedetto Piccoli, Héctor J. Sussmann
openaire   +1 more source

Optimality condition: Constraint regularization

Mathematical Programming, 1977
Necessity and sufficiency conditions are given for the existence of a finite set of redundant constraints which together with a given set of constraints in an optimization problem satisfy the Kuhn—Tucker, and the Guignard Constraint qualifications when the original set of constraints fails to satisfy either or both of them.
openaire   +1 more source

Inverse functions of pseudo regular mappings and regularity conditions

Mathematical Programming, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

General Growth Conditions and Regularity

1996
We study the local regularity of minimizers of integral functionals of the calculus of variations of the type $$ F(v) = \int\limits_{\Omega } f \left( {Dv} \right)dx $$ (1) where Ω is an open set of ℝ n (n > 2), Du is the N × n matrix of the gradient of u: Ω → ℝ N and f : ℝ N×n → ℝ is a given convex function.
openaire   +2 more sources