The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 941 – 960 of 9187

Showing per page

A self-scaling memoryless BFGS based conjugate gradient method using multi-step secant condition for unconstrained minimization

Yongjin Kim, Yunchol Jong, Yong Kim (2024)

Applications of Mathematics

Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. Based on the self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno (SSML-BFGS) method, new conjugate gradient algorithms CG-DESCENT and CGOPT have been proposed by W. Hager, H. Zhang (2005) and Y. Dai, C. Kou (2013), respectively. It is noted that the two conjugate gradient methods perform more efficiently than the SSML-BFGS method. Therefore,...

A semi-smooth Newton method for solving elliptic equations with gradient constraints

Roland Griesse, Karl Kunisch (2009)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Semi-smooth Newton methods for elliptic equations with gradient constraints are investigated. The one- and multi-dimensional cases are treated separately. Numerical examples illustrate the approach and as well as structural features of the solution.

A sensitivity-based extrapolation technique for the numerical solution of state-constrained optimal control problems

Michael Hintermüller, Irwin Yousept (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Sensitivity analysis (with respect to the regularization parameter) of the solution of a class of regularized state constrained optimal control problems is performed. The theoretical results are then used to establish an extrapolation-based numerical scheme for solving the regularized problem for vanishing regularization parameter. In this context, the extrapolation technique provides excellent initializations along the sequence of reducing regularization parameters. Finally, the favorable numerical behavior...

A set oriented approach to global optimal control

Oliver Junge, Hinke M. Osinga (2004)

ESAIM: Control, Optimisation and Calculus of Variations

We describe an algorithm for computing the value function for “all source, single destination” discrete-time nonlinear optimal control problems together with approximations of associated globally optimal control strategies. The method is based on a set oriented approach for the discretization of the problem in combination with graph-theoretic techniques. The central idea is that a discretization of phase space of the given problem leads to an (all source, single destination) shortest path problem...

A set oriented approach to global optimal control

Oliver Junge, Hinke M. Osinga (2010)

ESAIM: Control, Optimisation and Calculus of Variations

We describe an algorithm for computing the value function for “all source, single destination” discrete-time nonlinear optimal control problems together with approximations of associated globally optimal control strategies. The method is based on a set oriented approach for the discretization of the problem in combination with graph-theoretic techniques. The central idea is that a discretization of phase space of the given problem leads to an (all source, single destination) shortest path...

A short philosophical note on the origin of smoothed aggregations

Fraňková, Pavla, Hanuš, Milan, Kopincová, Hana, Kužel, Roman, Vaněk, Petr, Vastl, Zbyněk (2013)

Applications of Mathematics 2013

We derive the smoothed aggregation two-level method from the variational objective to minimize the final error after finishing the entire iteration. This contrasts to a standard variational two-level method, where the coarse-grid correction vector is chosen to minimize the error after coarse-grid correction procedure, which represents merely an intermediate stage of computing. Thus, we enforce the global minimization of the error. The method with smoothed prolongator is thus interpreted as a qualitatively...

A sign preserving mixed finite element approximation for contact problems

Patrick Hild (2011)

International Journal of Applied Mathematics and Computer Science

This paper is concerned with the frictionless unilateral contact problem (i.e., a Signorini problem with the elasticity operator). We consider a mixed finite element method in which the unknowns are the displacement field and the contact pressure. The particularity of the method is that it furnishes a normal displacement field and a contact pressure satisfying the sign conditions of the continuous problem. The a priori error analysis of the method is closely linked with the study of a specific positivity...

A simple and efficient scheme for phase field crystal simulation

Matt Elsey, Benedikt Wirth (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We propose an unconditionally stable semi-implicit time discretization of the phase field crystal evolution. It is based on splitting the underlying energy into convex and concave parts and then performing H-1 gradient descent steps implicitly for the former and explicitly for the latter. The splitting is effected in such a way that the resulting equations are linear in each time step and allow an extremely simple implementation and efficient solution. We provide the associated stability and error...

Currently displaying 941 – 960 of 9187