<--- Back to Details
First PageDocument Content
Interior point method / Quadratic programming / Penalty method / Linear programming / Quasi-Newton method / Lagrange multiplier / Gauss–Newton algorithm / Karush–Kuhn–Tucker conditions / Duality / Numerical analysis / Mathematical optimization / Mathematical analysis
Date: 2013-11-12 21:06:32
Interior point method
Quadratic programming
Penalty method
Linear programming
Quasi-Newton method
Lagrange multiplier
Gauss–Newton algorithm
Karush–Kuhn–Tucker conditions
Duality
Numerical analysis
Mathematical optimization
Mathematical analysis

j489 Index a accuracy – avoiding numerical problems 20

Add to Reading List

Source URL: www.wiley-vch.de

Download Document from Source Website

File Size: 170,73 KB

Share Document on Facebook

Similar Documents

Math. Program., Ser. B 100: 95–Digital Object Identifier (DOIs10107Nick Gould · Philippe L. Toint Preprocessing for quadratic programming

DocID: 1v8H0 - View Document

LEARNING A CLASSIFICATION OF MIXED-INTEGER QUADRATIC PROGRAMMING PROBLEMS Pierre Bonami Andrea Lodi

DocID: 1ulPL - View Document

Feedback for reg. noCE000: Programming in Java — Roots of a Quadratic Presentation: 12/25 Oh dear! Your program is absolutely devoid of comments, which means that anyone encountering the code for the first

DocID: 1u6LO - View Document

A weighted gram-schmidt method for convex quadratic programming

DocID: 1tRnC - View Document

Technical Report TRA Comparison of Several Solvers for Bound Constraint Quadratic Programming within the Context of Frictionless Multibody Dynamics

DocID: 1tHhe - View Document