Superlinearly convergent affine scaling interior trust-region method for linear constrained LC^1 minimization
From MaRDI portal
Publication:960640
DOI10.1007/S10114-008-5444-9zbMATH Open1167.90021OpenAlexW2380321685MaRDI QIDQ960640FDOQ960640
Authors: Detong Zhu
Publication date: 5 January 2009
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-008-5444-9
Recommendations
- A superlinearly convergent trust region algorithm for \(LC^1\) constrained optimization problems
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables
- scientific article; zbMATH DE number 1942631
- A globally and superlinearly convergent trust region method for \(LC^1\) optimization problems
- An interior trust region method for linear constrained \(LC^1\) convex optimization problems
- A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
- Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization
- A trust-region and affine scaling algorithm for linearly constrained optimization
global convergenceinterior pointlinearly constrained optimizationsuperlinear convergencebacktrackingtrust-region methodaffine scaling
Cites Work
- Numerical Optimization
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Weakly Differentiable Functions
- A Nonmonotone Line Search Technique for Newton’s Method
- On NCP-functions
- A special newton-type optimization method
- A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
- A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints.
- Title not available (Why is that?)
- Globally convergent inexact generalized Newton method for first-order differentiable optimization problems
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
Cited In (9)
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables
- Title not available (Why is that?)
- Superlinear convergence of affine scaling interior point Newton method for linear inequality constrained minimization without strict complementarity
- A globally and superlinearly convergent trust region method for \(LC^1\) optimization problems
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- A superlinearly convergent trust region algorithm for \(LC^1\) constrained optimization problems
- Title not available (Why is that?)
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization
- An Affine Scaling Interior Point Filter Line-Search Algorithm for Linear Inequality Constrained Minimization
This page was built for publication: Superlinearly convergent affine scaling interior trust-region method for linear constrained \(LC^{1}\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960640)