A hybrid method for the nonlinear least squares problem with simple bounds (Q1177199): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable-metric variant of the Karmarkar algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Non-Linear Least-Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Large Scale Nonlinear Least Squares Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine-scaling for linear programs with free variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Nonlinear Least Squares with Linear Inequality Constraints / rank
 
Normal rank

Latest revision as of 10:26, 15 May 2024

scientific article
Language Label Description Also known as
English
A hybrid method for the nonlinear least squares problem with simple bounds
scientific article

    Statements

    A hybrid method for the nonlinear least squares problem with simple bounds (English)
    0 references
    0 references
    0 references
    26 June 1992
    0 references
    The authors consider the nonlinear least squares problem with simple bounds of the form: \[ f(x)=1/2\| F(x)\|^ 2_ 2 = 1/2\sum^ m_{i=1}F^ 2_ i(x) = \min_ x ! \] subject to the constraints \(1\leq x\leq u\); \(x,l,u\in \mathbb{R}^ n\) where \(F(x)=(F_ 1(x),\dots,F_ m(x))\) with \(F_ i(x)\in C^ 2\). The method proposed in the paper to solve such a problem constructs trust region constraints, which are ellipses centered at iterative elements, in such a way that they lie in the interior of the feasible region. To avoid the numerical instability implied by the position of the solutions of the problem on the boundary of the feasible region, the idea of active set strategy is incorporated into the method. The authors prove a convergence theorem for the method and show its practical efficiency by numerical experiments. The experiments support the claim that the method retains the advantage of the interior point method also in the case of boundary position of solutions and indicate the particular efficiency of the approach for large scale problems.
    0 references
    nonlinear least squares problem
    0 references
    trust region constraints
    0 references
    active set strategy
    0 references
    convergence
    0 references
    numerical experiments
    0 references
    interior point method
    0 references
    large scale problems
    0 references
    affine-scaling
    0 references
    trust region method
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references