Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
113 hits
in 72,247,077 documents
in 0.28 seconds
Please leave the following field blank:
Home
»
Search: Michael Ulbrich
Hit List
Hit list
1.
Automatic Differentiation: A StructureExploiting Forward Mode with Almost Optimal Complexity for Kantorovic Trees
Open Access
Title:
Automatic Differentiation: A StructureExploiting Forward Mode with Almost Optimal Complexity for Kantorovic Trees
Author:
Michael Ulbrich And
;
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
Michael Ulbrich And
;
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
. A structureexploiting forward mode is discussed that achieves almost optimal complexity for functions given by Kantorovic trees. It is based on approriate representations of the gradient and the Hessian. After a brief exposition of the forward and reverse mode of automatic differentiation for derivatives up to second order and compact proofs ...
. A structureexploiting forward mode is discussed that achieves almost optimal complexity for functions given by Kantorovic trees. It is based on approriate representations of the gradient and the Hessian. After a brief exposition of the forward and reverse mode of automatic differentiation for derivatives up to second order and compact proofs of their complexities, the new forward mode is presented and analyzed. It is shown that in the case of functions f : IR n ! IR with a tree as Kantorovic graph the algorithm is only O(ln(n)) times as expensive as the reverse mode. Except for the fact that the new method is a very efficient implementation of the forward mode, it can be used to significantly reduce the length of characterizing sequences before applying the memory expensive reverse mode. For the Hessian all discussed algorithms are shown to be efficiently parallelizable. Some numerical examples confirm the advantages of the new forward mode. Keywords. automatic differentiation, characterizing sequence, code list, forward mode, reverse mode, Kantorovic graph, Kantorovic tree, time complexity, parallelization. 1.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090415
Source:
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/TRIAMS19961TUM.ps.gz
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/TRIAMS19961TUM.ps.gz
Minimize
Document Type:
text
Language:
en
Subjects:
characterizing sequence ; code list ; forward mode ; reverse mode ; Kantorovic graph ; Kantorovic tree ; time complexity ; parallelization
characterizing sequence ; code list ; forward mode ; reverse mode ; Kantorovic graph ; Kantorovic tree ; time complexity ; parallelization
Minimize
DDC:
511 General principles of mathematics
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.2886
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/TRIAMS19961TUM.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.2886
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/TRIAMS19961TUM.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
Nonmonotone Trust Region Methods for Nonlinear Equality Constrained Optimization without a Penalty Function
Open Access
Title:
Nonmonotone Trust Region Methods for Nonlinear Equality Constrained Optimization without a Penalty Function
Author:
Michael Ulbrich
;
Stefan Ulbrich
Michael Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
We propose and analyze a class of penaltyfunctionfree nonmonotone trustregion methods for nonlinear equality constrained optimization problems. The algorithmic framework yields global convergence without using a merit function and allows nonmonotonicity independently for both, the constraint violation and the value of the Lagrangian function....
We propose and analyze a class of penaltyfunctionfree nonmonotone trustregion methods for nonlinear equality constrained optimization problems. The algorithmic framework yields global convergence without using a merit function and allows nonmonotonicity independently for both, the constraint violation and the value of the Lagrangian function. Similar to the ByrdOmojokun class of algorithms, each step is composed of a quasinormal and a tangential step. Both steps are required to satisfy a decrease condition for their respective trustregion subproblems. The proposed mechanism for accepting steps combines nonmonotone decrease conditions on the constraint violation and/or the Lagrangian function, which leads to a flexibility and acceptance behavior comparable to filterbased methods. We establish the global convergence of the method. Furthermore, transition to quadratic local convergence is proved. Numerical tests are presented that confirm the robustness and efficiency of the approach.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090827
Source:
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/nmtr.ps.gz
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/nmtr.ps.gz
Minimize
Document Type:
text
Language:
en
Subjects:
convergence ; equality constraints ; local convergence ; largescale optimization
convergence ; equality constraints ; local convergence ; largescale optimization
Minimize
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.237
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/nmtr.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.237
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/nmtr.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
Primaldual interiorpoint methods for pdeconstrained optimization
Open Access
Title:
Primaldual interiorpoint methods for pdeconstrained optimization
Author:
Michael Ulbrich
;
Stefan Ulbrich
Michael Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
Abstract. This paper provides a detailed analysis of a primaldual interiorpoint method for PDEconstrained optimization. Considered are optimal control problems with control constraints in L p. It is shown that the developed primaldual interiorpoint method converges globally and locally superlinearly. Not only the easier L ∞setting is analy...
Abstract. This paper provides a detailed analysis of a primaldual interiorpoint method for PDEconstrained optimization. Considered are optimal control problems with control constraints in L p. It is shown that the developed primaldual interiorpoint method converges globally and locally superlinearly. Not only the easier L ∞setting is analyzed, but also a more involved L qanalysis, q < ∞, is presented. In L ∞ , the set of feasible controls contains interior points and the Fréchet differentiability of the perturbed optimality system can be shown. In the L qsetting, which is highly relevant for PDEconstrained optimization, these nice properties are no longer available. Nevertheless, a convergence analysis is developed using refined techniques. In particular, twonorm techniques and a smoothing step are required.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090107
Source:
http://www.optimizationonline.org/DB_FILE/2006/04/1374.pdf
http://www.optimizationonline.org/DB_FILE/2006/04/1374.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4981
http://www.optimizationonline.org/DB_FILE/2006/04/1374.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4981
http://www.optimizationonline.org/DB_FILE/2006/04/1374.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
Superlinear Convergence of AffineScaling InteriorPoint Newton Methods for InfiniteDimensional Nonlinear Problems with Pointwise Bounds
Open Access
Title:
Superlinear Convergence of AffineScaling InteriorPoint Newton Methods for InfiniteDimensional Nonlinear Problems with Pointwise Bounds
Author:
Michael Ulbrich
;
Stefan Ulbrich
Michael Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
We develop and analyze a superlinearly convergent affinescaling interiorpoint Newton method for infinitedimensional problems with pointwise bounds in L^pspace. The problem formulation is motivated by optimal control problems with L^pcontrols and pointwise control constraints. The finitedimensional convergence theory by Coleman and Li (SIAM...
We develop and analyze a superlinearly convergent affinescaling interiorpoint Newton method for infinitedimensional problems with pointwise bounds in L^pspace. The problem formulation is motivated by optimal control problems with L^pcontrols and pointwise control constraints. The finitedimensional convergence theory by Coleman and Li (SIAM J. Optim., 6 (1996), pp. 418445) makes essential use of the equivalence of norms and the exact identifiability of the active constraints close to an optimizer with strict complementarity. Since these features are not available in our infinitedimensional framework, algorithmic changes are necessary to ensure fast local convergence. The main building block is a Newtonlike iteration for an affinescaling formulation of the KKTcondition. We demonstrate in an example that a stepsize rule to obtain an interior iterate may require very small stepsizes even arbitrarily close to a nondegenerate solution. Using a pointwise projection instead .
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20110523
Source:
http://wwwm1.ma.tum.de/m1/personen/mulbrich/papers/Local.ps.gz
http://wwwm1.ma.tum.de/m1/personen/mulbrich/papers/Local.ps.gz
Minimize
Document Type:
text
Language:
en
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.2342
http://wwwm1.ma.tum.de/m1/personen/mulbrich/papers/Local.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.2342
http://wwwm1.ma.tum.de/m1/personen/mulbrich/papers/Local.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Superlinear Convergence of AffineScaling InteriorPoint Newton Methods for InfiniteDimensional Nonlinear Problems with Pointwise Bounds
Open Access
Title:
Superlinear Convergence of AffineScaling InteriorPoint Newton Methods for InfiniteDimensional Nonlinear Problems with Pointwise Bounds
Author:
Michael Ulbrich
;
Stefan Ulbrich
Michael Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
We develop and analyze a superlinearly convergent affinescaling interiorpoint Newton method for infinitedimensional problems with pointwise bounds in L p space. The problem formulation is motivated by optimal control problems with L p controls and pointwise control constraints. The finitedimensional convergence theory by Coleman and Li (SI...
We develop and analyze a superlinearly convergent affinescaling interiorpoint Newton method for infinitedimensional problems with pointwise bounds in L p space. The problem formulation is motivated by optimal control problems with L p controls and pointwise control constraints. The finitedimensional convergence theory by Coleman and Li (SIAM J. Optim., 6 (1996), pp. 418445) makes essential use of the equivalence of norms and the exact identifiability of the active constraints close to an optimizer with strict complementarity. Since these features are not available in our infinitedimensional framework, algorithmic changes are necessary to ensure fast local convergence. The main building block is a Newtonlike iteration for an affinescaling formulation of the KKTcondition. We demonstrate in an example that a stepsize rule to obtain an interior iterate may require very small stepsizes even arbitrarily close to a nondegenerate solution. Using a pointwise projection instead .
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20110922
Source:
ftp://softlib.rice.edu/pub/CRPCTRs/reports/CRPCTR97697.ps.gz
ftp://softlib.rice.edu/pub/CRPCTRs/reports/CRPCTR97697.ps.gz
Minimize
Document Type:
text
Language:
en
Subjects:
optimality
optimality
Minimize
DDC:
518 Numerical analysis
(computed)
;
510 Mathematics
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.1155
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.1155
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
Superlinear Convergence of AffineScaling InteriorPoint Newton Methods for InfiniteDimensional Nonlinear Problems with Pointwise Bounds
Open Access
Title:
Superlinear Convergence of AffineScaling InteriorPoint Newton Methods for InfiniteDimensional Nonlinear Problems with Pointwise Bounds
Author:
Michael Ulbrich
;
Stefan Ulbrich
Michael Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
We develop and analyze a superlinearly convergent affinescaling interiorpoint Newton method for infinitedimensional problems with pointwise bounds in L p space. The problem formulation is motivated by optimal control problems with L p controls and pointwise control constraints. The finitedimensional convergence theory by Coleman and Li (SI...
We develop and analyze a superlinearly convergent affinescaling interiorpoint Newton method for infinitedimensional problems with pointwise bounds in L p space. The problem formulation is motivated by optimal control problems with L p controls and pointwise control constraints. The finitedimensional convergence theory by Coleman and Li (SIAM J. Optim., 6 (1996), pp. 418445) makes essential use of the equivalence of norms and the exact identifiability of the active constraints close to an optimizer with strict complementarity. Since these features are not available in our infinitedimensional framework, algorithmic changes are necessary to ensure fast local convergence. The main building block is a Newtonlike iteration for an affinescaling formulation of the KKTcondition. We demonstrate in an example that a stepsize rule to obtain an interior iterate may require very small stepsizes even arbitrarily close to a nondegenerate solution. Using a pointwise projection instead .
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20121121
Source:
http://wwwlit.ma.tum.de/veroeff/quel/970.49014.ps.gz
http://wwwlit.ma.tum.de/veroeff/quel/970.49014.ps.gz
Minimize
Document Type:
text
Language:
en
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.7558
http://wwwlit.ma.tum.de/veroeff/quel/970.49014.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.7558
http://wwwlit.ma.tum.de/veroeff/quel/970.49014.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
Superlinear and quadratic convergence of affinescaling interiorpoint Newton methods for problems with simple bounds without strict complementarity assumption
Open Access
Title:
Superlinear and quadratic convergence of affinescaling interiorpoint Newton methods for problems with simple bounds without strict complementarity assumption
Author:
Matthias Heinkenschloss Michael
;
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
Matthias Heinkenschloss Michael
;
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
A class of affinescaling interiorpoint methods for bound constrained optimization problems is introduced which are locally qsuperlinear or qquadratic convergent. It is assumed that the strong second order sufficient optimality conditions at the solution are satisfied, but strict complementarity is not required. The methods are modification...
A class of affinescaling interiorpoint methods for bound constrained optimization problems is introduced which are locally qsuperlinear or qquadratic convergent. It is assumed that the strong second order sufficient optimality conditions at the solution are satisfied, but strict complementarity is not required. The methods are modifications of the affinescaling interiorpoint Newton methods introduced by T. F. Coleman and Y. Li (Math. Programming, 67:189224, 1994). There are two modifications. One is a modification of the scaling matrix, the other one is the use of a projection of the step to maintain strict feasibility rather than a simple scaling of the step. A comprehensive local convergence analysis is given. A simple example is presented to illustrate the pitfalls of the original approach by Coleman and Li in the degenerate case and to demonstrate the performance of the fast converging modifications developed in this paper. Key words: Bound constraints, affine scaling, in.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090413
Source:
http://www.caam.rice.edu/~heinken/papers/deglocal.ps.gz
http://www.caam.rice.edu/~heinken/papers/deglocal.ps.gz
Minimize
Document Type:
text
Language:
en
Subjects:
conditions
conditions
Minimize
DDC:
510 Mathematics
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8485
http://www.caam.rice.edu/~heinken/papers/deglocal.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8485
http://www.caam.rice.edu/~heinken/papers/deglocal.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
A globally convergent primaldual interiorpoint filter method for nonlinear programming
Open Access
Title:
A globally convergent primaldual interiorpoint filter method for nonlinear programming
Author:
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
;
Luís N. Vicente
;
Luís N. Vicente
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
;
Luís N. Vicente
;
Luís N. Vicente
Minimize authors
Description:
A globally convergent primaldual interiorpoint filter method for nonlinear programming
A globally convergent primaldual interiorpoint filter method for nonlinear programming
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080717
Source:
http://www.opt.tudarmstadt.de/forschung/nichtlin/Team/
ulbrich
/papers/ipfilter.pdf
http://www.opt.tudarmstadt.de/forschung/nichtlin/Team/
ulbrich
/papers/ipfilter.pdf
Minimize
Document Type:
text
Language:
en
Subjects:
Key words. interiorpoint methods ; primaldual ; filter
Key words. interiorpoint methods ; primaldual ; filter
Minimize
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.8265
http://www.opt.tudarmstadt.de/forschung/nichtlin/Team/ulbrich/papers/ipfilter.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.8265
http://www.opt.tudarmstadt.de/forschung/nichtlin/Team/ulbrich/papers/ipfilter.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function
Open Access
Title:
Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function
Author:
Technische Universität München
;
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
Technische Universität München
;
Michael Ulbrich
;
Michael Ulbrich
;
Stefan Ulbrich
;
Stefan Ulbrich
Minimize authors
Description:
Abstract. We propose and analyze a class of penaltyfunctionfree nonmonotone trustregion methods for nonlinear equality constrained optimization problems. The algorithmic framework yields global convergence without using a merit function and allows nonmonotonicity independently for both, the constraint violation and the value of the Lagrangian...
Abstract. We propose and analyze a class of penaltyfunctionfree nonmonotone trustregion methods for nonlinear equality constrained optimization problems. The algorithmic framework yields global convergence without using a merit function and allows nonmonotonicity independently for both, the constraint violation and the value of the Lagrangian function. Similar to the Byrd–Omojokun class of algorithms, each step is composed of a quasinormal and a tangential step. Both steps are required to satisfy a decrease condition for their respective trustregion subproblems. The proposed mechanism for accepting steps combines nonmonotone decrease conditions on the constraint violation and/or the Lagrangian function, which leads to a flexibility and acceptance behavior comparable to filterbased methods. We establish the global convergence of the method. Furthermore, transition to quadratic local convergence is proved. Numerical tests are presented that confirm the robustness and efficiency of the approach.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080717
Source:
http://wwwlit.ma.tum.de/veroeff/quel/009.65011.pdf
http://wwwlit.ma.tum.de/veroeff/quel/009.65011.pdf
Minimize
Document Type:
text
Language:
en
Subjects:
Key words
Key words
Minimize
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.3868
http://wwwlit.ma.tum.de/veroeff/quel/009.65011.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.3868
http://wwwlit.ma.tum.de/veroeff/quel/009.65011.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Constrained Optimal Control of NavierStokes Flow by Semismooth Newton Methods
Open Access
Title:
Constrained Optimal Control of NavierStokes Flow by Semismooth Newton Methods
Author:
Michael Ulbrich
Michael Ulbrich
Minimize authors
Description:
We propose and analyze a semismooth Newtontype method for the solution of a pointwise constrained optimal control problem governed by the timedependent incompressible NavierStokes equations. The method is based on a reformulation of the optimality system as an equivalent nonsmooth operator equation. We analyze the flow control problem and est...
We propose and analyze a semismooth Newtontype method for the solution of a pointwise constrained optimal control problem governed by the timedependent incompressible NavierStokes equations. The method is based on a reformulation of the optimality system as an equivalent nonsmooth operator equation. We analyze the flow control problem and establish qsuperlinear convergence of the method. In the numerical implementation, adjoint techniques are combined with a truncated conjugate gradient method. Numerical results are presented that support our theoretical results and confirm the viability of the approach.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20110922
Source:
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/scl.ps.gz
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/scl.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1637
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/scl.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.1637
http://wwwm1.mathematik.tumuenchen.de/m1/personen/mulbrich/papers/scl.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(37) The Pennsylvania State University CiteSeerX...
(30) Michael Ulbrich
(21) Stefan Ulbrich
(15) Ulbrich, Michael
(14) Böhnlein, Michael
(13) Ulbrichvom Ende, Achim
(10) Matthias Heinkenschloss
(8) Ulbrich, Michael (Prof. Dr.)
(7) Kaveh Ghayour
(6) Jockusch, Harald
(6) S. Scott Collis
(5) Plaha, Markus
(5) SchmittJohn, Thomas
(4) Achim Ulbrichvom Ende
(4) Coon, Joshua J.
(4) Fuchs, Sonja
(4) Marcon, Magda
(4) Nanz, Daniel
(4) Platzer, Matthias
(4) Resch, Karin
(4) Sinz, Elmar J.
(4) Thiel, Cora
(4) Ulbrich, Arne
(4) Ulbrich, Heinz (Prof. Dr. Dr. habil.)
(4) Westphall, Michael S.
(3) Andreisek, Gustav
(3) Balabanova, Yanina
(3) Buda, Silke
(3) Burger, Reinhard
(3) Eckmanns, Tim
(3) Gilsdorf, Andreas
(3) Gärtner, Barbara
(3) Haas, Walter
(3) Hamouda, Osamah
(3) Hübner, Johannes
(3) Jänisch, Thomas
(3) Kist, Manfred
(3) Kramer, Michael H.
(3) Krause, Gérard
(3) Ledig, Thomas
(3) Mielke, Martin
(3) Pulz, Matthias
(3) Stark, Klaus
(3) Suttorp, Norbert
(3) Ulbrich, Stefan
(3) Ulbrich, Uta
(3) Wichmann, Ole
(2) Achim Ulbrich
(2) Akperov, Mirseid G.
(2) Beck, Michael
(2) Bellenbaum, Nina
(2) Benestad, Rasmus
(2) Blender, Richard
(2) Caballero, Rodrigo
(2) Ciritsis, Bernhard
(2) Cocozza, Angela
(2) Fehrenbach, Silke
(2) Feng, Yang
(2) Fischer, Michael
(2) Fischer, Michael A
(2) Fraedrich, Klaus
(2) Grieger, Jens
(2) Grimm, Daniela
(2) Groß, Uwe
(2) Gulev, Sergey
(2) Hanley, John
(2) Hebert, Alexander S.
(2) Hewson, Tim
(2) Hine, Michael J.
(2) Humpert, Andreas
(2) Höhn, BerndRobert (Prof. Dr.)
(2) Inatsu, Masaru
(2) Ji, Shaobo
(2) Keay, Kevin
(2) Kew, Sarah F.
(2) Kindem, Ina
(2) Kunisch, Karl (Prof. Dr.)
(2) Laux, Christoph
(2) LauxenUlbrich, Maria
(2) Leckebusch, Gregor C.
(2) Leicht, René
(2) Liberato, Margarida L. R.
(2) Lionello, Piero
(2) Luís N. Vicente
(2) Michael Boehnlein
(2) Michael Böhnlein
(2) Michael Teschke
(2) Mokhov, Igor I.
(2) Neu, Urs
(2) Pietsch, Jessica
(2) Ramirez, Alex
(2) Reale, Marco
(2) Riordan, Rob
(2) Rudeva, Irina
(2) Schuster, Mareike
(2) Simmonds, Ian
(2) Sinclair, Mark
(2) Sprenger, Michael
(2) Technische Universität München
(2) Tilinina, Natalia D.
Author:
Subject
(7) ddc 510
(6) ddc 620
(4) research article
(3) conditions
(3) ddc 610
(3) filter
(3) optimierung
(3) optimization
(3) primal dual
(2) 330 wirtschaft
(2) 610 medicine health
(2) article
(2) clinic for diagnostic and interventional radiology
(2) clinic for trauma surgery
(2) convergence
(2) ddc 570
(2) entity relationship model erm
(2) epidemiology
(2) equality constraints
(2) interior point methods
(2) key words
(2) key words interior point methods
(2) large scale optimization
(2) local convergence
(2) mr
(2) optimal control
(2) segmentation
(2) structured entity
(1) 530 physics
(1) 550 earth sciences geology
(1) a posteriori error estimates
(1) a posteriori fehlerabschätzungen
(1) abdomen
(1) anregung
(1) assembly
(1) assessment
(1) astrogliosis
(1) auslegung
(1) bearing
(1) beurteilung
(1) bilevel optimierung
(1) bilevel optimization
(1) biology and life sciences
(1) car 2 x kommunikation
(1) car body functional model riding comfort...
(1) case reports
(1) characterizing sequence
(1) cirrhosis
(1) code list
(1) communicable diseases epidemiology
(1) communicable diseases microbiology
(1) complementarity and variational inequalities
(1) compressible navier stokes equations
(1) conceptual data model
(1) decision support system
(1) department of mechanical engi
(1) design
(1) doaj biology
(1) doaj biology and life sciences
(1) doaj genetics
(1) eigenfrequency
(1) eigenfrequenz
(1) electrophysiology and ablation
(1) excitation
(1) extremities
(1) fast southwell algorithm
(1) fast southwell verfahren
(1) finite elemente methode
(1) forward mode
(1) g500 information systems
(1) gasto energético diário fatores de risco...
(1) gear
(1) gears
(1) germany epidemiology
(1) geräusch
(1) getriebe
(1) global convergence
(1) gradient computation correspondence to
(1) hamilton jacobi equation
(1) hamilton jacobi gleichung
(1) haptic
(1) haptik
(1) health priorities standards
(1) human motions
(1) humans
(1) hyperbolic equations of second order
(1) hyperbolische gleichungen zweiter ordnung
(1) infectious pathogens epidemiological research
(1) info eu repo classification mesh communicable...
(1) info eu repo classification mesh germany
(1) info eu repo classification mesh health priorities
(1) info eu repo classification mesh humans
(1) info eu repo classification mesh population...
(1) info eu repo classification mesh reference...
(1) info info rb computer science robotics
(1) info info rb informatique robotique
(1) innere punkte verfahren
(1) inverse optimal control
(1) inverse optimalsteuerungsprobleme
(1) kantorovic graph
Subject:
Dewey Decimal Classification (DDC)
(23) Mathematics [51*]
(7) Engineering [62*]
(4) Life sciences; biology [57*]
(4) Medicine & health [61*]
(3) Computer science, knowledge & systems [00*]
(3) Science [50*]
(3) Literature, rhetoric & criticism [80*]
(2) Chemistry [54*]
(2) Geography & travel [91*]
(1) Library & information sciences [02*]
(1) Economics [33*]
(1) Social problems & social services [36*]
(1) Physics [53*]
(1) Technology [60*]
(1) Building & construction [69*]
Dewey Decimal Classification (DDC):
Year of Publication
(19) 2009
(16) 2013
(15) 2011
(9) 2008
(8) 2002
(8) 2014
(7) 2001
(7) 2012
(6) 2010
(5) 2000
(3) 2015
(2) 2003
(2) 2004
(2) 2005
(2) 2007
(1) 1997
Year of Publication:
Content Provider
(37) CiteSeerX
(13) Munich TU: mediaTUM
(13) Bamberg Univ.: Publication Server
(9) PubMed Central
(4) Aarhus Univ.: Pure
(3) HighWire Press
(3) Bielefeld Univ.: Publications
(2) DataCite Metadata Store
(2) Aachen RWTH: Publications
(2) Coimbra Univ.: Estudo Geral
(2) Leuven KU: Lirias
(2) Mannheim Univ.: MADOC
(2) Northumbria Univ.: Research Link
(2) Zurich Univ.: ZORA
(1) AIS Electronic Library (AISeL)
(1) BioMed Central
(1) HAL  Hyper Article en Ligne
(1) CERN (Switzerland)
(1) DOAJ Articles
(1) GFZ German Research Centre for Geosciences:...
(1) Munich LMU: Digital theses
(1) Robert Koch Institute: Publications
(1) Göttingen Univ.: GoeScholar
(1) Bochum Univ. (RUB): Campus Research Bibliography
(1) Glasgow Univ.
(1) Bern Univ.: BORIS
(1) Brasilia Catolica Univ.: EJournals
(1) Manchester Univ.: eScholar Services
(1) Reading Univ.: CentAUR
(1) Sussex Univ.
(1) Würzburg Univ.: Online Publication Service
Content Provider:
Language
(83) English
(20) German
(9) Unknown
(1) Portuguese
Language:
Document Type
(52) Text
(21) Article, Journals
(16) Theses
(14) Unknown
(5) Books
(5) Reports, Papers, Lectures
Document Type:
Access
(67) Open Access
(46) Unknown
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3

4

5

6

7

8

9

10

11
Next »
[12]
New Search »
Currently in BASE: 72,247,077 Documents of 3,474
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,247,077 Documents of 3,474 Content Sources
http://www.basesearch.net