A derivative free globally convergent method and its deformations
نویسندگان
چکیده
منابع مشابه
A globally convergent incremental Newton method
Motivated by machine learning problems over large data sets and distributed optimization over networks, we develop and analyze a new method called incremental Newton method for minimizing the sum of a large number of strongly convex functions. We show that our method is globally convergent for a variable stepsize rule. We further show that under a gradient growth condition, convergence rate is ...
متن کاملA Globally Convergent Stabilized SQP Method
Sequential quadratic programming (SQP) methods are a popular class of methods for nonlinearly constrained optimization. They are particularly effective for solving a sequence of related problems, such as those arising in mixed-integer nonlinear programming and the optimization of functions subject to differential equation constraints. Recently, there has been considerable interest in the formul...
متن کاملA globally convergent trust-region algorithm for unconstrained derivative-free optimization
In this work we explicit a derivative-free trust-region algorithm for unconstrained optimization based on the paper (Computational Optimization and Applications 53: 527–555, 2012) proposed by Powell. The objective function is approximated by quadratic models obtained by polynomial interpolation. The number of points of the interpolation set is fixed. In each iteration only one interpolation poi...
متن کاملA Globally Convergent Filter Method for MPECs
We propose a new method for mathematical programs with complementarity constraints that is globally convergent to B-stationary points. The method solves a linear program with complementarity constraints to obtain an estimate of the active set. It then fixes the activities and solves an equality-constrained quadratic program to obtain fast convergence. The method uses a filter to promote global ...
متن کاملA Globally Convergent LP-Newton Method
We develop a globally convergent algorithm based on the LP-Newton method, which has been recently proposed for solving constrained equations, possibly nonsmooth and possibly with nonisolated solutions. The new algorithm makes use of linesearch for the natural merit function and preserves the strong local convergence properties of the original LP-Newton scheme. We also present computational expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arabian Journal of Mathematics
سال: 2021
ISSN: 2193-5343,2193-5351
DOI: 10.1007/s40065-021-00323-3