Newton's method and quasi-Newton-SQP method for general LC^1 constrained optimization
From MaRDI portal
Publication:1294445
DOI10.1016/S0096-3003(97)10053-4zbMATH Open0937.90103OpenAlexW1997284724MaRDI QIDQ1294445FDOQ1294445
Authors: Wenyu Sun 
Publication date: 29 June 1999
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(97)10053-4
Recommendations
Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cites Work
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Title not available (Why is that?)
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Newton's Method for B-Differentiable Equations
- Title not available (Why is that?)
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Second-order and related extremality conditions in nonlinear programming
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Second-Order Sufficient Conditions in Nonsmooth Optimization
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Technical note: Directional derivatives in nonsmooth optimization
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Title not available (Why is that?)
- Computational schemes for large-scale problems in extended linear- quadratic programming
- Title not available (Why is that?)
Cited In (6)
- A filter-trust-region method for LC 1 unconstrained optimization and its global convergence
- Title not available (Why is that?)
- Quasi-Newton trust region algorithm for non-smooth least squares problems
- Triple reverse-order law for weighted generalized inverses
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
This page was built for publication: Newton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294445)
