Numerical Optimization | A Solver for Sparse KKT Matrices

Many solutions to constrained optimization problems require finding the solution to a linear system Ax = b. It is commonly the case that solving a linear system is the most costly step in optimizing the objective function and consequently, much work has been done in speeding up various solvers by exploiting various properties or structures within the matrix. For example, one can use the LU or QR decomposition to solve general linear systems of the form Ax = b. However, if the matrix A satisfies certain properties, then often the computation can be sped up by using a different matrix factorization. For example, for positive definite matrices there are solvers using the Cholesky decomposition, or the for more general symmetric matrices there are solvers using the LDLT decomposition. Furthermore, more recent work has focused on optimizing solvers for Ax = b where A is a sparse matrix, resulting in sparse versions of the aforementioned solvers.

Skills: Algorithm, Engineering, Mathematics, Matlab and Mathematica, Statistics

See more: numerical optimization, python numerical optimization, i need a person to mentor on how to use power point and make presentations in east rand, how to design your own a packaging box and what do it use, how many users use freelancer com, how many people use social media, how many people use freelancer, write a short paragraph to describe your family use words, write a report on how to detect fraud and how to solve it, translate a series of phrases into many lanugages, portfolio optimization excel solver, numerical optimization pid controllers, numerical optimization pid controller, numerical optimization matlab, goal optimization solver

About the Employer:
( 0 reviews ) Saudi Arabia

Project ID: #16966517

6 freelancers are bidding on average $25 for this job

$30 USD in 1 day
(28 Reviews)

If you are interested with my bid, we can chat about the details. Ozlem Kilickaya (Mechatronics Eng., Msc.)

$30 USD in 1 day
(1 Review)

A proposal has not yet been provided

$30 USD in 2 days
(1 Review)

Hi, as a PhD maths graduate this would be easy for me. In fact I PhD thesis uses the KKT conditions to prove unimodularity

$22 USD in 2 days
(0 Reviews)
$25 USD in 1 day
(0 Reviews)

I have already solved such KKT systems. [login to view URL] [login to view URL] I can finish the job in day.

$15 USD in 1 day
(0 Reviews)