Výsledky vyhledávání - "Tits, André L."

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

An Infeasible-Start Framework for Convex Quadratic Optimization, with Application to Constraint-Reduced Interior-Point Methods

Autor: Laiu, M. Paul, Tits, André L.

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function sc

Externí odkaz: http://arxiv.org/abs/1912.04335

Zobrazit plný text záznamu

Report

A Constraint-Reduced MPC Algorithm for Convex Quadratic Programming, with a Modified Active Set Identification Scheme

Autor: Laiu, M. Paul, Tits, André L.

A constraint-reduced Mehrotra-Predictor-Corrector algorithm for convex quadratic programming is proposed. (At each iteration, such algorithms use only a subset of the inequality constraints in constructing the search direction, resulting in CPU savin

Externí odkaz: http://arxiv.org/abs/1810.09243

Zobrazit plný text záznamu

Report

Adaptive change of basis in entropy-based moment closures for linear kinetic equations

Autor: Alldredge, Graham W., Hauck, Cory D., O'Leary, Dianne P., Tits, André L.

Entropy-based (M_N) moment closures for kinetic equations are defined by a constrained optimization problem that must be solved at every point in a space-time mesh, making it important to solve these optimization problems accurately and efficiently.

Externí odkaz: http://arxiv.org/abs/1306.2881

Zobrazit plný text záznamu