Výsledky vyhledávání - "Mathematical programming computation"

acados—a modular open-source framework for fast embedded optimal control Autor Verschueren, Robin, Frison, Gianluca, Kouzoupis, Dimitris, Frey, Jonathan, Duijkeren, Niels van, Zanelli, Andrea, Novoselnik, Branimir, Albin, Thivaharan, Quirynen, Rien, Diehl, Moritz

“…This paper presents the acados software package, a collection of solvers for fast embedded optimization intended for fast embedded applications. Its interfaces…”
Získat plný text

acados—a modular open-source framework for fast embedded optimal control Autor Verschueren, Robin, Frison, Gianluca, Kouzoupis, Dimitris, Frey, Jonathan, Duijkeren, Niels van, Zanelli, Andrea, Novoselnik, Branimir, Albin, Thivaharan, Quirynen, Rien, Diehl, Moritz

Získat plný text

JuMP 1.0: recent improvements to a modeling language for mathematical optimization Autor Lubin, Miles, Dowson, Oscar, Garcia, Joaquim Dias, Huchette, Joey, Legat, Benoît, Vielma, Juan Pablo

“…JuMP is an algebraic modeling language embedded in the Julia programming language. JuMP allows users to model optimization problems of a variety of kinds,…”
Získat plný text

OSQP: an operator splitting solver for quadratic programs Autor Stellato, Bartolomeo, Banjac, Goran, Goulart, Paul, Bemporad, Alberto, Boyd, Stephen

“…We present a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator…”
Získat plný text

CasADi: a software framework for nonlinear optimization and optimal control Autor Andersson, Joel A. E., Gillis, Joris, Horn, Greg, Rawlings, James B., Diehl, Moritz

“…We present CasADi, an open-source software framework for numerical optimization. CasADi is a general-purpose tool that can be used to model and solve…”
Získat plný text

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library Autor Gleixner, Ambros, Hendel, Gregor, Gamrath, Gerald, Achterberg, Tobias, Bastubbe, Michael, Berthold, Timo, Christophel, Philipp, Jarck, Kati, Koch, Thorsten, Linderoth, Jeff, Lübbecke, Marco, Mittelmann, Hans D., Ozyurt, Derya, Ralphs, Ted K., Salvagnin, Domenico, Shinano, Yuji

“…We report on the selection process leading to the sixth version of the Mixed Integer Programming Library, MIPLIB 2017. Selected from an initial pool of 5721…”
Získat plný text

Parallelizing the dual revised simplex method Autor Huangfu, Q., Hall, J. A. J.

“…This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One…”
Získat plný text

qpOASES: a parametric active-set algorithm for quadratic programming Autor Ferreau, Hans Joachim, Kirches, Christian, Potschka, Andreas, Bock, Hans Georg, Diehl, Moritz

“…Many practical applications lead to optimization problems that can either be stated as quadratic programming (QP) problems or require the solution of QP…”
Získat plný text

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints Autor Yang, Liuqin, Sun, Defeng, Toh, Kim-Chuan

“…In this paper, we present a majorized semismooth Newton-CG augmented Lagrangian method, called SDPNAL + , for semidefinite programming (SDP) with partial or…”
Získat plný text

Pyomo: modeling and solving mathematical programs in Python Autor Hart, William E., Watson, Jean-Paul, Woodruff, David L.

“…We describe Pyomo, an open source software package for modeling and solving mathematical programs in Python. Pyomo can be used to define abstract and concrete…”
Získat plný text

pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations Autor Nicholson, Bethany, Siirola, John D., Watson, Jean-Paul, Zavala, Victor M., Biegler, Lorenz T.

“…We describe pyomo.dae, an open source Python-based modeling framework that enables high-level abstract specification of optimization problems with differential…”
Získat plný text

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm Autor Wen, Zaiwen, Yin, Wotao, Zhang, Yin

“…The matrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on…”
Získat plný text

A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation Autor Tahernejad, Sahar, Ralphs, Ted K., DeNegre, Scott T.

“…In this paper, we describe a comprehensive algorithmic framework for solving mixed integer bilevel linear optimization problems (MIBLPs) using a generalized…”
Získat plný text

Faster exact solution of sparse MaxCut and QUBO problems Autor Rehfeldt, Daniel, Koch, Thorsten, Shinano, Yuji

“…The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the…”
Získat plný text

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems Autor Hijazi, Hassan, Coffrin, Carleton, Hentenryck, Pascal Van

“…This paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered…”
Získat plný text

Parallel stochastic gradient algorithms for large-scale matrix completion Autor Recht, Benjamin, Ré, Christopher

“…This paper develops Jellyfish , an algorithm for solving data-processing problems with matrix-valued decision variables regularized to have low rank…”
Získat plný text

Improved branch-cut-and-price for capacitated vehicle routing Autor Pecin, Diego, Pessoa, Artur, Poggi, Marcus, Uchoa, Eduardo

“…The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column…”
Získat plný text

A hybrid LP/NLP paradigm for global optimization relaxations Autor Khajavirad, Aida, Sahinidis, Nikolaos V.

“…Polyhedral relaxations have been incorporated in a variety of solvers for the global optimization of mixed-integer nonlinear programs. Currently, these…”
Získat plný text

Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem Autor Beck, Yasmine, Ljubić, Ivana, Schmidt, Martin

“…Developing solution methods for discrete bilevel problems is known to be a challenging task—even if all parameters of the problem are exactly known. Many…”
Získat plný text

QPLIB: a library of quadratic programming instances Autor Furini, Fabio, Traversi, Emiliano, Belotti, Pietro, Frangioni, Antonio, Gleixner, Ambros, Gould, Nick, Liberti, Leo, Lodi, Andrea, Misener, Ruth, Mittelmann, Hans, Sahinidis, Nikolaos V., Vigerske, Stefan, Wiegele, Angelika

“…This paper describes a new instance library for quadratic programming (QP), i.e., the family of continuous and (mixed)-integer optimization problems where the…”
Získat plný text