Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization problems.[1] It is related to, but distinct from, quasi-Newton methods.
Starting at some estimate of the optimal solution, the method is based on solving a sequence of first-order approximations (i.e. linearizations) of the model. The linearizations are linear programming problems, which can be solved efficiently. As the linearizations need not be bounded, trust regions or similar techniques are needed to ensure convergence in theory.
[2]
SLP has been used widely in the petrochemical industry since the 1970s.[3] Since then, however, they have been superseded by sequential quadratic programming methods. While solving a QP subproblem takes more time than solving an LP one, the overall decrease in the number of iterations, due to improved convergence, results in significantly lower running times and fewer function evaluations."
^(Nocedal & Wright 2006, p. 551)
^(Bazaraa, Sherali & Shetty 1993, p. 432)
^(Palacios-Gomez, Lasdon & Enquist 1982)
and 25 Related for: Successive linear programming information
SuccessiveLinearProgramming (SLP), also known as Sequential LinearProgramming, is an optimization technique for approximately solving nonlinear optimization...
and objective are represented by linear relationships. Linearprogramming is a special case of mathematical programming (also known as mathematical optimization)...
mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective...
mixed-integer programming problem. In integer linearprogramming, the canonical form is distinct from the standard form. An integer linearprogram in canonical...
function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. "Programming" in this context refers...
in a diverse range of SQP methods. Sequential linearprogramming Sequential linear-quadratic programming Augmented Lagrangian method SQP methods have been...
4 Linearprogramming problems are the simplest convex programs. In LP, the objective and constraint functions are all linear. Quadratic programming are...
Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified...
difference from dynamic programming, which is exhaustive and is guaranteed to find the solution. After every stage, dynamic programming makes decisions based...
logistics. This usage is the same as that in the phrases linearprogramming and mathematical programming, a synonym for mathematical optimization. The above...
Linear stationary iterative methods are also called relaxation methods. Krylov subspace methods work by forming a basis of the sequence of successive...
optimization. A considerable amount of it is unified by the theory of linearprogramming. Some examples of combinatorial optimization problems that are covered...
of the hard constraints are linear and some hard constraints are inequalities, then the problem is a linearprogramming problem. This can be solved by...
Coordinate descent is an optimization algorithm that successively minimizes along coordinate directions to find the minimum of a function. At each iteration...
methods or row-action methods. These methods solve convex programming problems with linear constraints. They are iterative methods where each step projects...
mathematical programming problem (a term not directly related to computer programming, but still in use for example in linearprogramming – see History...
independently proposed a similar method in 1907. Its convergence properties for non-linear optimization problems were first studied by Haskell Curry in 1944, with...
need two function evaluations per iteration. Therefore, the method has linear convergence with rate 0.5 ≈ 0.71 {\displaystyle {\sqrt {0.5}}\approx 0.71}...
In operations research, the Big M method is a method of solving linearprogramming problems using the simplex algorithm. The Big M method extends the simplex...
on graphs, matroids and other discrete structures integer programming constraint programming These branches are all closely intertwined however, since...
of combinatorial optimization for solving integer linearprograms (ILPs), that is, linearprogramming (LP) problems where some or all the unknowns are...
Global Information