On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
From MaRDI portal
Publication:3033234
DOI10.1093/imanum/6.3.357zbMath0691.65054MaRDI QIDQ3033234
Publication date: 1986
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b3cb395e7bf56362ddf48f107fc15541c05c5c42
numerical results; nonlinear programming; sequential methods; search direction; penalty-function approach; linear infinite descent; locating directions of negative curvature
Related Items
Quadratic rate of convergence for a primal-dual exponential penalty algorithm, A two parameter mixed interior-exterior penalty algorithm, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, A new semi-penalty method for nonlinear programming, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, New theoretical results on recursive quadratic programming algorithms, Modifying the inertia of matrices arising in optimization, Stable exponential-penalty algorithm with superlinear convergence, On solving three classes of nonlinear programming problems via simple differentiable penalty functions, Inertia-controlling factorizations for optimization algorithms, Maximizing pseudoconvex transportation problem: A special type, Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Huber approximation for the non-linear \(l_{1}\) problem, Using constraint preconditioners with regularized saddle-point problems
