<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-12-13 19:53:35Mathematics Convex optimization Linear programming Penalty method Karush–Kuhn–Tucker conditions Constraint optimization Optimization problem Interior point method Multidisciplinary design optimization Mathematical optimization Mathematical analysis Operations research |
| Transposition theorems and qualification-free optimality conditions Hermann Schichl and Arnold Neumaier Fakult¨at f¨ ur Mathematik, Universit¨at Wien Nordbergstr. 15, A-1090 Wien, AustriaDocID: 18Xlx - View Document |
| Mathematical Programming SERIES A and B Constraint aggregation for rigorous global optimization --Manuscript Draft-Manuscript Number: MAPR-D-14-00182R2DocID: 17CZf - View Document |
| PDF DocumentDocID: 17rmL - View Document |
| Robust Fitting for Multiple View Geometry Olof Enqvist, Erik Ask, Fredrik Kahl, and Kalle ˚ Astr¨om Centre for Mathematical Sciences, Lund University http://www.maths.lth.se/vision/DocID: 16T0V - View Document |
| Math. Appl), 143–166 DOI: maDYNAMIC PRICING WITH CAPACITY CONSTRAINTS AND INVENTORY REPLENISHMENT ASMUND OLSTADDocID: 16f5a - View Document |