Suchergebnisse - mathematik optimization. approximation theory. interior programming. linear programming.*

Preconditioning indefinite systems in interior point methods for large scale linear optimisation.

Autoren: Al-Jeiroudi, Ghussoun Gondzio, Jacek Hall, Julian

Quelle: Optimization Methods & Software; Jun2008, Vol. 23 Issue 3, p345-363, 19p, 4 Charts

Schlagwörter: CONJUGATE gradient methods, APPROXIMATION theory, MATHEMATICAL optimization, LINEAR systems, LINEAR programming, INTERIOR-point methods, ALGORITHMS, SPARSE matrix software

An approximation algorithm for convex multi-objective programming problems.

Autoren: Ehrgott, Matthias Shao, Lizhen Schöbel, Anita

Quelle: Journal of Global Optimization; Jul2011, Vol. 50 Issue 3, p397-416, 20p

Schlagwörter: MATHEMATICAL optimization, SET theory, NONLINEAR programming, APPROXIMATION theory, ALGORITHMS

Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization.

Autoren: Pearson, John Gondzio, Jacek

Quelle: Numerische Mathematik; Dec2017, Vol. 137 Issue 4, p959-999, 41p

Schlagwörter: NONLINEAR programming, QUADRATIC programming, MATHEMATICAL programming, NUMERICAL analysis, MATHEMATICAL analysis

A dual variant of Benson's 'outer approximation algorithm' for multiple objective linear programming.

Autoren: Ehrgott, Matthias Löhne, Andreas Shao, Lizhen

Quelle: Journal of Global Optimization; Apr2012, Vol. 52 Issue 4, p757-778, 22p

Schlagwörter: SPACES of measures, LINEAR programming, DUALITY theory (Mathematics), APPROXIMATION algorithms, MATHEMATICAL decomposition

Interior projection-like methods for monotone variational inequalities.

Autoren: Auslender, Alfred Teboulle, Marc

Quelle: Mathematical Programming; Sep2005, Vol. 104 Issue 1, p39-68, 30p

Schlagwörter: METHOD of steepest descent (Numerical analysis), APPROXIMATION theory, ASYMPTOTIC expansions, CONVEX programming, MATHEMATICAL programming

Bibliography.

Autoren: Ye, Yinyu

Quelle: Interior Point Algorithms: Theory & Analysis; 1997, p365-408, 44p

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem: Approximation algorithms for the discrete time-cost tradeoff problem

Autoren: Skutella, Martin

Quelle: Mathematics of Operations Research. 23:909-929

Schlagwörter: Deterministic scheduling theory in operations research, time-cost tradeoff, Analysis of algorithms and problem complexity, bicriteria optimization, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 510 Mathematik, scheduling, 02 engineering and technology, ddc:510, Programming involving graphs or networks, approximation algorithm, budget

Dateibeschreibung: application/xml; application/pdf; application/octet-stream

Zugangs-URL: http://www.math.tu-berlin.de/~skutella/MOR98.pdf
https://dblp.uni-trier.de/db/conf/soda/soda97.html#Skutella97
https://dl.acm.org/doi/10.5555/314161.314375
http://page.math.tu-berlin.de/~skutella/MOR98.pdf
https://www.jstor.org/stable/3690638
https://dl.acm.org/doi/10.5555/2804694.2804701
https://depositonce.tu-berlin.de/handle/11303/15527

General primal-dual penalty/barrier path-following Newton methods for nonlinear programming.

Autoren: Grossmann, C. Zadlo, M.

Quelle: Optimization; Dec2005, Vol. 54 Issue 6, p641-663, 23p, 3 Charts, 4 Graphs

Schlagwörter: NONLINEAR programming, NEWTON-Raphson method, INTERIOR-point methods, MATRICES (Mathematics), LINEAR dependence (Mathematics), MATHEMATICAL programming, MATHEMATICAL optimization

A function approximation approach to the segmentation step in IMRT planning.

Autoren: Kiesel, Antje

Quelle: OR Spectrum; Jan2012, Vol. 34 Issue 1, p181-198, 18p

Schlagwörter: RADIOTHERAPY, APPROXIMATION theory, STRATEGIC planning, MATHEMATICAL optimization, COLLIMATORS, CONVEX programming, MEDICAL quality control

Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems.

Autoren: Sturm, Jos F.

Quelle: Optimization Methods & Software; Dec2002, Vol. 17 Issue 6, p1105, 50p

Schlagwörter: MATHEMATICAL programming, MATHEMATICAL optimization

NONLINEAR OPTIMIZATION BY SUCCESSIVE LINEAR PROGRAMMING.

Autoren: Palacios-Gomez, F. Lasdon, L. Engquist, M.

Quelle: Management Science; Oct82, Vol. 28 Issue 10, p1106-1120, 15p

Schlagwörter: LINEAR programming, MATHEMATICAL programming, PRODUCTION scheduling, DYNAMIC programming, MATHEMATICAL optimization, DEGREES of freedom, NONLINEAR programming, APPROXIMATION theory, MANAGEMENT science

Benson type algorithms for linear vector optimization and applications.

Autoren: Hamel, Andreas Löhne, Andreas Rudloff, Birgit

Quelle: Journal of Global Optimization; Aug2014, Vol. 59 Issue 4, p811-836, 26p

Schlagwörter: APPROXIMATION algorithms, MATHEMATICAL optimization, PROBLEM solving, LINEAR programming, ITERATIVE methods (Mathematics), NUMERICAL analysis

Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming

Autoren: Vigerske, Stefan

Thesis Advisors: Römisch, Werner, Schultz, Rüdiger, Bonami, Pierre

Schlagwörter: Optimierung, Stabilität, Mathematische Programmierung, stochastische Optimierung, gemischt-ganzzahlige nichtlineare Optimierung, MINLP, constraint ganzzahlige Optimierung, Dekomposition, rekombinierende Szenariobäume, äußere Approximation, Relaxierung, Löser, Konvexifizierung, Reformulierung, mathematical programming, stability, optimization, stochastic programming, mixed-integer nonlinear programming, constraint integer programming, decomposition, recombining scenario tree, outer-approximation, relaxation, solver, convexification, reformulation, branch-and-bound, 510 Mathematik, 27 Mathematik, SK 800, ddc:510

Dateibeschreibung: application/pdf

Verfügbarkeit: http://edoc.hu-berlin.de/18452/17356

Bounds for the quadratic assignment problem using the bundle method.

Autoren: Rendl, Franz Sotirov, Renata

Quelle: Mathematical Programming; Feb2007, Vol. 109 Issue 2/3, p505-524, 20p, 1 Diagram, 10 Charts, 2 Graphs

Schlagwörter: MATHEMATICAL programming, APPROXIMATION theory, ASSIGNMENT problems (Programming), RELAXATION methods (Mathematics), INTERIOR-point methods

Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.

Autoren: Mizuno, Shinji Jarre, Florian

Quelle: Mathematical Programming; 1999, Vol. 84 Issue 1, p105, 18p

Schlagwörter: ALGORITHMS, LINEAR programming, LINEAR systems, ITERATIVE methods (Mathematics), APPROXIMATION theory

Stability analysis of nonlinear systems with linear programming :a Lyapunov functions based approach

Weitere Verfasser: Sigurður Freyr Marinósson

Verfügbarkeit: http://data.europeana.eu/aggregation/europeana/2048441/item_W4XZJNYVN74YQU6MBOV52F6V4T3M55GZ
http://data.europeana.eu/item/2048441/item_W4XZJNYVN74YQU6MBOV52F6V4T3M55GZ

Piecewise linear approximations in nonconvex nonsmooth optimization.

Autoren: M. Gaudioso E. Gorgone M. Monaco

Quelle: Numerische Mathematik; Jul2009, Vol. 113 Issue 1, p73-88, 16p

Schlagwörter: PIECEWISE linear topology, APPROXIMATION theory, NONSMOOTH optimization, REAL variables, ALGORITHMS, QUADRATIC programming, STOCHASTIC convergence

The Sample Average Approximation Method for Stochastic Discrete Optimization

Autoren: Kleywegt, Anton J. Shapiro, Alexander Higle, Julie L. et al.

Weitere Verfasser: Kleywegt, Anton J. Shapiro, Alexander Higle, Julie L. et al.

Schlagwörter: ddc:510, stochastic programming, stopping rules, Monte Carlo sampling, sample average approximation, law of large numbers, discrete optimization, 510 Mathematik, large deviations theory, stochastic knapsack problem

Dateibeschreibung: application/pdf; application/postscript

ON THE USE OF AN APPROXIMATE CONSTRAINT PRECONDITIONER IN A POTENTIAL REDUCTION ALGORITHM FOR QUADRATIC PROGRAMMING.

Autoren: CAFIERI, S. D'APUZZO, M. DE SIMONE, V. et al.

Quelle: Applied & Industrial Mathematics in Italy II- Selected Contributions From the 8th Simai Conference; 2007, p220-230, 11p

Schlagwörter: MATHEMATICAL simplification, QUADRATIC programming, APPROXIMATION theory, LINEAR systems, NUMERICAL analysis

On Control‐Approximation Problems in Hilbert Spaces and Related Dual Problems: Subdifferentiability Properties and Estimates: On control-approximation problems in Hilbert spaces and related dual problems: Subdifferentiability properties and estimates

Autoren: S. Dietze

Quelle: Zeitschrift für Angewandte Mathematik und Mechanik Band 63, Heft 1 ISBN: 9783112549247

Schlagwörter: Abstract differentiation theory, differentiation of set functions, Methods of successive quadratic programming type, Convex programming, Abstract approximation theory (approximation in normed linear spaces and other abstract spaces), Inner product spaces and their generalizations, Hilbert spaces, dual problems, abstract control-approximation problems, Existence theories for problems in abstract spaces, subdifferentiability of cost functionals, 0101 mathematics, Optimality conditions for problems in abstract spaces, Duality theory (optimization), 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3822539
https://doi.org/10.1002/zamm.19830630106
http://ui.adsabs.harvard.edu/abs/1983ZaMM...63...29D/abstract