Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
type: Item
instance of: scholarly article
title: Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
zbMATH Open document ID: 0820.90102
DOI: 10.1007/BF01582577
author: Liqun Qi
published in: Mathematical Programming. Series A. Series B
publication date: 1994-10-10T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 636172
zbMATH Keywords: semismoothness
zbMATH Keywords: superlinear convergence
zbMATH Keywords: second-order derivatives
MaRDI profile type: Publication
cites work: Q3690580
cites work: Optimization and nonsmooth analysis
cites work: A unified approach to global convergence of trust region methods for nonsmooth optimization
cites work: Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
cites work: Penalty function versus non-penalty function methods for constrained nonlinear programming problems
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Q5652137
cites work: Minimization of Locally Lipschitzian Functions
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
cites work: Semismoothness and decomposition of maximal normal operators
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A nonsmooth version of Newton's method
cites work: An SQP algorithm for extended linear-quadratic problems in stochastic programming
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
cites work: Computational schemes for large-scale problems in extended linear- quadratic programming
cites work: Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
cites work: An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
cites work: Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
full work available at URL: https://doi.org/10.1007/bf01582577
OpenAlex ID: W2042725681
description: scientific article; zbMATH DE number 636172