Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "nonsmooth optimization" wg kryterium: Temat


Tytuł:
Quasidifferentiable Calculus and Minimal Pairs of Compact Convex Sets
Autorzy:
Pallaschke, Diethard
Urbański, Ryszard
Powiązania:
https://bibliotekanauki.pl/articles/1373556.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
nonsmooth optimization
generalized convexity
Opis:
The quasidifferential calculus developed by V.F. Demyanov and A.M. Rubinov provides a complete analogon to the classical calculus of differentiation for a wide class of nonsmooth functions. Although this looks at the first glance as a generalized subgradient calculus for pairs of subdifferentials it turns out that, after a more detailed analysis, the quasidifferential calculus is a kind of Fréchet-differentiation whose gradients are elements of a suitable Minkowski–Rådström–Hörmander space. One aim of the paper is to point out this fact. The main results in this direction are Theorem 1 and Theorem 5. Since the elements of the Minkowski–Rådström–Hörmander space are not uniquely determined, we focus our attention in the second part of the paper to smallest possible representations of quasidifferentials, i.e. to minimal representations. Here the main results are two necessary minimality criteria, which are stated in Theorem 9 and Theorem 11.
Źródło:
Schedae Informaticae; 2012, 21; 107-125
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Structural optimization with a non-smooth buckling load criterion
Autorzy:
Folgado, J.
Rodrigues, H.
Powiązania:
https://bibliotekanauki.pl/articles/205875.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
homogenizacja
optymalizacja
wyboczenie
buckling
homogenization
nonsmooth optimization
structures
Opis:
This work addresses problems in optimal design of structures with a non-smooth buckling load criterion and in particular appliactions in layout design of plate reinforcements using a material based model and thickness beam optimization problems. Starting with the formulation of the linearized buckling problem, the optimization problem is formulated and the optimal necessary conditions are derived. Considering the possibility of non-differentiability of the objective function, the optimal necessary conditions are stated in terms of generalized gradients for non-smooth functions. The importance of the obtained result is analyzed and directional derivatives of the critical load factor obtained from the generalized gradient set definition, are compared with forward finite difference approximations. Optimization applications, to test the developments done, are presented. They are performed using a mathematical programming code, the Bundle Trust Method, which addresses the nonsmoothness of the problem.
Źródło:
Control and Cybernetics; 1998, 27, 2; 235-253
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Composite semi-infinite optimization
Autorzy:
Dentcheva, D.
Ruszczyński, A.
Powiązania:
https://bibliotekanauki.pl/articles/970266.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
semi-infinite optimization
nonsmooth optimization
composite optimization
stochastic programming
stochastic dominance
Opis:
We consider a semi-infinite optimization problem in Banach spaces, where both the objective functional and the constraint operator are compositions of convex nonsmooth mappings and differentiable mappings. We derive necessary optimality conditions for these problems. Finally, we apply these results to non-convex stochastic optimization problems with stochastic dominance constraints, generalizing earlier results.
Źródło:
Control and Cybernetics; 2007, 36, 3; 633-646
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regularization error estimates and discrepancy principle for optimal control problems with inequality constraints
Autorzy:
Wachsmuth, D.
Wachsmuth, G.
Powiązania:
https://bibliotekanauki.pl/articles/206129.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
source condition
discrepancy principle
nonsmooth optimization
convex constraints
sparsity
regularization error estimates
Opis:
In this article we study the regularization of optimization problems by Tikhonov regularization. The optimization problems are subject to pointwise inequality constraints in L²(Ω). We derive a-priori regularization error estimates if the regularization parameter as well as the noise level tend to zero. We rely on an assumption that is a combination of a source condition and of a structural assumption on the active sets. Moreover, we introduce a strategy to choose the regularization parameter in dependence of the noise level. We prove convergence of this parameter choice rule with optimal order.
Źródło:
Control and Cybernetics; 2011, 40, 4; 1125-1158
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The shooting approach in analyzing bang-bang extremals with simultaneous control switches
Autorzy:
Felgenhauer, U.
Powiązania:
https://bibliotekanauki.pl/articles/969603.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
bang-bang control
Lipschitz stability in optimal control
nonsmooth optimization
shooting type methods
Opis:
The paper is devoted to stability investigation of optimal structure and switching points position for parametric bang-bang control problem with special focus on simultaneous switches of two control components. In contrast to problems where only simple switches occur, the switching points in general are no longer differentiable functions of input parameters. Conditions for Lipschitz stability are found which generalize known sufficient optimality conditions to nonsmooth situation. The analysis makes use of backward shooting representation of extremals, and of generalized implicit function theorems. The Lipschitz properties are illustrated for an example by constructing backward parameterized family of extremals and providing first-order switching points prediction.
Źródło:
Control and Cybernetics; 2008, 37, 2; 307-327
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Random perturbation of the variable metric method for unconstrained nonsmooth nonconvex optimization
Autorzy:
El Mouatasim, A.
Ellaia, R.
Souza de Cursi, J. E.
Powiązania:
https://bibliotekanauki.pl/articles/908374.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja
zaburzenie stochastyczne
zaburzenie losowe
nonconvex optimization
stochastic perturbation
variable metric method
nonsmooth optimization
generalized gradient
Opis:
We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We introduce a variable metric descent method adapted to nonsmooth situations, which is modified by the incorporation of suitable random perturbations. Convergence to a global minimum is established and a simple method for the generation of suitable perturbations is introduced. An algorithm is proposed and numerical results are presented, showing that the method is computationally effective and stable.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 463-474
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
Autorzy:
El Mouatasim, A.
Ellaia, R.
Souza de Cursi, E.
Powiązania:
https://bibliotekanauki.pl/articles/907785.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja globalna
ograniczenie liniowe
zaburzenie stochastyczne
global optimization
linear constraints
variable metric method
stochastic perturbation
nonsmooth optimization
Opis:
We present a random perturbation of the projected variable metric method for solving linearly constrained nonsmooth (i.e., nondifferentiable) nonconvex optimization problems, and we establish the convergence to a global minimum for a locally Lipschitz continuous objective function which may be nondifferentiable on a countable set of points. Numerical results show the effectiveness of the proposed approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 317-329
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Local cone approximations in optimization
Autorzy:
Castellani, M.
Pappalardo, M.
Powiązania:
https://bibliotekanauki.pl/articles/970281.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
nonsmooth optimization
cone approximations
generalized directional epiderivatives
optimality conditions
constraint qualifications
mean value theorem
error bound
Opis:
We show how to use intensively local cone approximations to obtain results in some fields of optimization theory such as optimality conditions, constraint qualifications, mean value theorems and error bound.
Źródło:
Control and Cybernetics; 2007, 36, 3; 583-600
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal control of constrained delay-differential inclusions with multivalued initial conditions
Autorzy:
Mordukhovich, B. S.
Wang, L.
Powiązania:
https://bibliotekanauki.pl/articles/970519.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
aproksymacja dyskretna
warunek konieczny optymalności
analiza wariacyjna
stabilność
optymalizacja niegładka
różniczkowanie uogólnione
delay-differential inclusions
discrete approximations
necessary optimality conditions
variational analysis
stability
nonsmooth optimization
generalized differentiation
Opis:
This paper studies a general optimal control problem for nonconvex delay-differential inclusions with endpoint constraints. In contrast to previous publications on this topic, we incorporate time-dependent set constraints on the initial interval, which are specific for systems with delays and provide an additional source for optimization. Our variational analysis is based on well-posed discrete approximations of constrained delay-differential inclusions by a family of time-delayed systems with discrete dynamics and perturbed constraints. Using convergence results for discrete approximations and advanced tools of nonsmooth variational analysis, we derive necessary optimality conditions for constrained delay-differential inclusions in both Euler-Lagrange and Hamiltonian forms involving nonconvex generalized differential constructions for nonsmooth functions, sets, and set-valued mappings.
Źródło:
Control and Cybernetics; 2003, 32, 3; 585-609
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Unilateral Contact Applications Using Fem Software
Autorzy:
Stavroulaki, M. E.
Stavroulakis, G. E.
Powiązania:
https://bibliotekanauki.pl/articles/907898.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
matematyka
nonsmooth analysis
constrained optimization
contact problem
Opis:
Nonsmooth analysis, inequality constrained optimization and variational inequalities are involved in the modelling of unilateral contact problems. The corresponding theoretical and algorithmic tools, which are part of the area known as nonsmooth mechanics, are by no means classical. In general purpose software some of these tools (perhaps in a simplified way) are currently available. Two engineering applications, a rubber-coated roller contact problem and a masonry wall, solved with MARC, are briefly presented, together with elements of the underlying theory.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 1; 115-125
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies