Search Results - locally convergent nonlinear programming algorithms

A locally and cubically convergent algorithm for computing ð'µ‐eigenpairs of symmetric tensors by Zhao, Ruijuan, Zheng, Bing, Liang, Maolin, Xu, Yangyang

“…) for it. Our proposed MNNM method is proved to be locally and cubically convergent under some suitable conditions, which greatly improves the Newton correction method and the orthogonal Newton correction…”
Get full text

A semismooth Newton method for nonlinear symmetric cone programming by Kong, Lingchen, Meng, Qingmin

“…In this paper, we employ the projection operator to design a semismooth Newton algorithm for solving nonlinear symmetric cone programming (NSCP…”
Get full text

A nonlinear Lagrangian based on Fischer-Burmeister NCP function by Ren, Yong-Hong, Zhang, Li-Wei, Xiao, Xian-Tao

“… The convergence theorem shows that the sequence of points generated by this nonlinear Lagrange algorithm is locally convergent when the penalty parameter is less than a threshold under a set…”
Get full text

An R -linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer–Burmeister merit function by Chen, Jein-Shan, Gao, Hung-Ta, Pan, Shaohua

“…], the authors proposed a derivative-free descent algorithm for nonlinear complementarity problems (NCPs…”
Get full text

Properties of the Augmented Lagrangian in Nonlinear Semidefinite Optimization by Sun, J., Zhang, L. W., Wu, Y.

“… It is shown that, under a set of sufcient conditions, the augmented Lagrangian algorithm is locally convergent when the penalty parameter is larger than a certain threshold…”
Get full text

A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming by Anitescu, Mihai

“… We compare this algorithm with sequential quadratic programming algorithms on several degenerate nonlinear programs…”
Get full text

An SQP method for minimization of locally Lipschitz functions with nonlinear constraints by Yousefpour, Rohollah, Jafari, Elham

“… This method is based on sequential quadratic programming that uses an penalty function to equilibrate among the decrease of the objective function and the feasibility of the constraints…”
Get full text

Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data by Le Thi, Hoai An, Huynh, Van Ngai, Pham Dinh, Tao

“…Difference-of-Convex programming and related algorithms, which constitute the backbone of nonconvex programming and global optimization, were introduced in 1985 by Pham Dinh Tao and have been…”
Get full text

Adaptive dynamic programming by Murray, J.J., Cox, C.J., Lendaris, G.G., Saeks, R.

“… constraint and guarantee convergence is required. The objective of the paper is to describe an adaptive dynamic programming algorithm (ADPA…”
Get full text

Research on The Optimal Solution of Lagrangian Multiplier Function Method in Nonlinear Programming by Jin, Xue

“… that under appropriate conditions, the iterative point generated by the dual algorithm based on the function The column is locally convergent, and then an error estimate of the solution related to the penalty parameter is given…”
Get full text

Nonlinear robust optimization via sequential convex bilevel programming by Houska, Boris, Diehl, Moritz

“…In this paper, we present a novel sequential convex bilevel programming algorithm for the numerical solution of structured nonlinear min…”
Get full text

Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming by Chen, Liang, Zhu, Junyuan, Zhao, Xinyuan

“… We first show in a unified fashion that under a few abstract assumptions, the proposed method is locally convergent and possesses a (nonasymptotic…”
Get full text

Invariant Adaptive Dynamic Programming for Discrete-Time Optimal Control by Zhu, Yuanheng, Zhao, Dongbin, He, Haibo

“… An invariant adaptive dynamic programming algorithm is developed to extend the method to scenarios where system dynamics is not available. Online data are utilized to learn the near-optimal policy and the invariantly admissible region. Simulated experiments verify the effectiveness of our method…”
Get full text

A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization by Liu, Xinwei, Yuan, Yaxiang

“…We present a sequential quadratic programming method without using a penalty function or a filter for solving nonlinear equality constrained optimization…”
Get full text

A quadratically convergent primal decomposition algorithm with soft coupling for nonlinear parameter estimation by Kouzoupis, Dimitris, Quirynen, Rien, Garcia, Jesus Lago, Erhard, Michael, Diehl, Moritz

“… In this paper, we propose a novel algorithm for a certain class of nonconvex, separable optimization problems that combines both distributed computations and locally quadratic convergence…”
Get full text

A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity by Becher, Letícia, Fernández, Damián, Ramos, Alberto

“… Our algorithm is based on a modification of the fast locally convergent Linear Programming (LP)-Newton method with a trust-region strategy for globalization that makes use of the natural merit function…”
Get full text

Nonlinear rescaling Lagrangians for nonconvex semidefinite programming by Zhang, Liwei, Li, Yang, Wu, Jia

“… A set of conditions on the convex real-valued functions is proposed to guarantee the convergence of nonlinear rescaling Lagrangian algorithms…”
Get full text

A truncated Newton method in an augmented Lagrangian framework for nonlinear programming by Di Pillo, Gianni, Liuzzi, Giampaolo, Lucidi, Stefano, Palagi, Laura

“…In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming problems…”
Get full text

Inexact Interior-Point Method for PDE-Constrained Nonlinear Optimization by Grote, Marcus J., Huber, Johannes, Kourounis, Drosos, Schenk, Olaf

“… Because it uses the full Hessian matrix, modifying it whenever needed, the method not only is globally convergent, but also converges fast locally…”
Get full text

A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations by Yigui, Ou

“… Furthermore, it is proved under appropriate assumptions that this algorithm is globally and locally super-linearly convergent…”
Get full text