NPSOL

Last updated

NPSOL is a software package that performs numerical optimization. It solves nonlinear constrained problems using the sequential quadratic programming algorithm. It was written in Fortran by Philip Gill of UCSD and Walter Murray, Michael Saunders and Margaret Wright of Stanford University. The name derives from a combination of NP for nonlinear programming and SOL, the Systems Optimization Laboratory at Stanford.

Sequential quadratic programming (SQP) is an iterative method for constrained nonlinear optimization. SQP methods are used on mathematical problems for which the objective function and the constraints are twice continuously differentiable.

Fortran General-purpose programming language

Fortran is a general-purpose, compiled imperative programming language that is especially suited to numeric computation and scientific computing.

Stanford University private research university located in Stanford, California, United States

Leland Stanford Junior University is a private research university in Stanford, California. Stanford is known for its academic strength, wealth, proximity to Silicon Valley, and ranking as one of the world's top universities.

Related Research Articles

NASTRAN is a finite element analysis (FEA) program that was originally developed for NASA in the late 1960s under United States government funding for the aerospace industry. The MacNeal-Schwendler Corporation (MSC) was one of the principal and original developers of the publicly available NASTRAN code. NASTRAN source code is integrated in a number of different software packages, which are distributed by a range of companies.

IPOPT, short for "Interior Point OPTimizer, pronounced I-P-Opt", is a software library for large scale nonlinear optimization of continuous systems. It is written in Fortran and C and is released under the EPL. IPOPT implements a primal-dual interior point method, and uses line searches based on Filter methods. IPOPT can be called from various modeling environments and C.

SNOPT, for Sparse Nonlinear OPTimizer, is a software package for solving large-scale nonlinear optimization problems written by Philip Gill, Walter Murray and Michael Saunders. SNOPT is mainly written in Fortran, but interfaces to C, C++, Python and MATLAB are available.

Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also polynomial time but proved to be inefficient in practice.

Tinker, stylized as TINKER, is a computer software application for molecular dynamics simulation with a complete and general package for molecular mechanics and molecular dynamics, with some special features for biopolymers. The core of the package is a modular set of callable routines which allow manipulating coordinates and evaluating potential energy and derivatives via straightforward means.

The Galahad library is a thread-safe library of packages for the solution of optimization—or mathematical programming—problems. The areas covered by the library are unconstrained and bound-constrained optimization, quadratic programming, nonlinear programming, systems of nonlinear equations and inequalities, and nonlinear least squares problems. The library is mostly written in the Fortran 90 programming language.

Trilinos is a collection of open-source software libraries, called packages, intended to be used as building blocks for the development of scientific applications. The word "Trilinos" is Greek and conveys the idea of "a string of pearls", suggesting a number of software packages linked together by a common infrastructure. Trilinos was developed at Sandia National Laboratories from a core group of existing algorithms and utilizes the functionality of software interfaces such as the BLAS, LAPACK, and MPI.

PENOPT is an optimization software package. Its goal is to develop a unified approach to problems of nonlinear programming and semidefinite programming. The solvers are based on a generalized augmented Lagrangian method combined with the Trust region algorithm.

Margaret H. Wright is an American computer scientist and mathematician.

Michael Alan Saunders is an American numerical analyst and computer scientist. He is a Research Professor of Management Science and Engineering at Stanford University. Saunders is known for his contributions to numerical linear algebra and numerical optimization and has developed many widely used software packages, such as MINOS, NPSOL, and SNOPT.

LINDO is a software package for linear programming, integer programming, nonlinear programming, stochastic programming and global optimization.

MINOS is a Fortran software package for solving linear and nonlinear mathematical optimization problems. MINOS may be used for linear programming, quadratic programming, and more general objective functions and constraints, and for finding a feasible point for a set of linear or nonlinear equalities and inequalities.

Convex Over and Under ENvelopes for Nonlinear Estimation (Couenne) is an open-source library for solving global optimization problems, also termed mixed integer nonlinear optimization problems. A global optimization problem requires to minimize a function, called objective function, subject to a set of constraints. Both the objective function and the constraints might be nonlinear and nonconvex. For solving these problems, Couenne uses a reformulation procedure and provides a linear programming approximation of any nonconvex optimization problem.

TOLMIN is a numerical optimization algorithm by Michael J. D. Powell. It is also the name of Powell's Fortran 77 implementation of the algorithm.

Artelys Knitro is a commercial software package for solving large scale nonlinear mathematical optimization problems.

NEOS Server

The NEOS Server is an Internet-based client-server application that provides free access to a library of optimization solvers. Its library of solvers includes more than 60 commercial, free and open source solvers, which can be applied to mathematical optimization problems of more than 12 different types, including linear programming, integer programming and nonlinear optimization.

References

Gill, Philip; Murray, Walter; Saunders, Michael; Wright, Margaret (4 June 2001), "User's Guide for NPSOL 5.0: A Fortran Package for Nonlinear Programming" (PDF), Technical Report SOL 86-6