Explicit continuation methods with L-BFGS updating formulas for linearly constrained optimization problems

01/18/2021
by   Xin-Long Luo, et al.
0

This paper considers an explicit continuation method with the trusty time-stepping scheme and the limited-memory BFGS (L-BFGS) updating formula (Eptctr) for the linearly constrained optimization problem. At every iteration, Eptctr only involves three pairs of the inner product of vector and one matrix-vector product, other than the traditional and representative optimization method such as the sequential quadratic programming (SQP) or the latest continuation method such as Ptctr <cit.>, which needs to solve a quadratic programming subproblem (SQP) or a linear system of equations (Ptctr). Thus, Eptctr can save much more computational time than SQP or Ptctr. Numerical results also show that the consumed time of EPtctr is about one tenth of that of Ptctr or one fifteenth to 0.4 percent of that of SQP. Furthermore, Eptctr can save the storage space of an (n+m) × (n+m) large-scale matrix, in comparison to SQP. The required memory of Eptctr is about one fifth of that of SQP. Finally, we also give the global convergence analysis of the new method under the standard assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2021

Tikhonov regularization continuation methods and the trust-region updating strategy for linearly equality-constrained optimization problems

This paper considers the Tikhonv regularization continuation method and ...
research
03/26/2023

The regularization continuation method for optimization problems with nonlinear equality constraints

This paper considers the regularization continuation method and the trus...
research
03/10/2021

Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system

This paper considers the generalized continuation Newton method and the ...
research
05/12/2020

Continuation Method with the Trust-region Time-stepping Scheme for Linearly Constrained Optimization with Noise Data

The nonlinear optimization problem with linear equality constraints has ...
research
12/29/2020

Explicit continuation methods and preconditioning techniques for unconstrained optimization problems

This paper considers an explicit continuation method and the trust-regio...
research
08/27/2018

A Limitation of V-Matrix based Methods

To estimate the conditional probability functions based on the direct pr...
research
02/05/2020

Limited-memory polynomial methods for large-scale matrix functions

Matrix functions are a central topic of linear algebra, and problems req...

Please sign up or login with your details

Forgot password? Click here to reset