Uploaded by MatheonBerlin on Aug 18, 2010
In unconstrained optimization so-called quasi-Newton methods have been very succesfull and are widely used. They alleviate the need to evaluate second derivatives and, at the same time, reduce the linear algebra effort for computing each new iteration point from cubic to quadratic with respect to n .
For constrained optimization, classical SQP implementations salvage only the first but not the second desirable feature in the more general context of constrained optimization. Also, they require at each iteration the evaluation of all constraint gradients, which is in general m times as expensive as evaluating the constraint functions as such.
The 'total quasi-Newton' approach combines the selective evaluation of cheaply available derivatives via Algorithmic Differentiation (AD) with the approximation of the Jacobian and Hessian matrices by new, linearly invariant update formulas. As a result the linear algebra cost per iteration is only quadratic with respect to n+m, and the evaluation effort is bounded by a small multiple of that needed to compute the objective and derivative values by themselves. Due to the heredity property of the updates equality constrained quadratic programs are solved exactly in n steps for almost all initializations of primal and dual variables as well as Jacobian and Hessian approximations.
We intend to develop an NLP solver that requires only the input of an evaluation program for objective and constraints with first and second derivative vectors being computed by AD. It should be highly competetive for problems with n and m in the thousands, where dense Jacobians and Hessians can be stored in main memory and thus efficiently manipulated. For larger problems data sparse matrix representations of the kind suggested in are envisaged. Moreover, sparse preconditioning that renders the relative matrix discrepancies compact must be incorporated for structured problem classes, such as those arising in optimal control.
-
4 likes, 0 dislikes
-
Source videos:
Loading...
View attributions »
4:36
Richard Feynman on - philosophy, Why question, Modern science and Mathematics.aviby pitupraveen43,399 views
3:30
TU-Berlin Matheon Mathematik Geometrie - Schönheit der Mathematikby toom20091,688 views
2:46
Adding a New Constraint to an Optimization Problemby dougsimmsonline491 views
10:12
How to Find Derivative of a Function by First Principle Method 2by SkyingBlogger2,519 views
1:35
MATLAB bandem Demo: Unconstrained Optimzationby DesignImpact1348 views
8:02
A bridge across the Volga river in Volgograd, Russiaby offf262,649 views
6:50
Using the Moore-Penrose Pseudoinverse to Solve Linear Equationsby timeparticle2,017 views
1:13
Google image swirl, resolve an ambiguous query visually.wmvby ittechil257 views
10:13
Algebra(iterative function)by MsTimastb288 views
1:46
Roblox - Algorithmic Pattern Terrain Generatorby darthglowball2,295 views
14:20
Velocity, Force and the Jacobian Part 1by milfordrobotics931 views
3:39
Analytical Mechanics, Lesson 5: Gauge Theory, Coordinate Invariance, The Hessian condition, Energyby MichaelKovarik3,887 views
2:28
Calculus: Second Derivative Testby Mindbitesdotcom9,330 views
10:58
tNavigator Advanced Examples Part3 HD (eng)by RockFlowDynamics1,395 views
2:25
Interactive Skeletonization of Intensity Volumesby sasakthi609 views
4:46
The Jacobianby patrickJMT57,105 views
1:30
DNA microarraysby Proneural256,766 views
3:20
Compensating Indirect Scatteringby arBUW324 views
0:41
5R Manipulator: Pseudo inverse of jacobianby YobaMich1,893 views
4:09
Mathematical Planning of Orthopaedic Surgeryby MatheonBerlin559 views
- Loading more suggestions...
Link to this comment:
All Comments (0)