A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2006.05.057 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Trust Region Algorithm for Nonlinearly Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conic trust-region method for nonlinearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conic Algorithm for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>Q</i>-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New minimax algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order conditions for an exact penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trust region methods for unconstrained minimization without derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone trust region method for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Algorithm for General Large Scale Nonlinear Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified SQP method and its global convergence / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2006.05.057 / rank
 
Normal rank

Latest revision as of 06:02, 10 December 2024

scientific article
Language Label Description Also known as
English
A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy
scientific article

    Statements

    A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 February 2007
    0 references
    The following nonlinear optimization problem is considered: \[ \min f_0(x)\text{ subject to }f_i(x)= 0,\quad\forall i\in E,\;f_j(x)\leq 0\;\forall j\in I, \] where \(E\), \(I\) are given finite index sets and \(f_k\) are twice continuously differentiable functions for all \(k\in E\cup I\cup\{0\}\). A new algorithm for solving this optimization problem is proposed. The algorithm combines conic model methods, trust region techniques and active-set strategies. Further a new approximate method for the trust region sub-problem is suggested. Global convergence of the proposed algorithm is obtained. In the concluding part of the paper, the algorithm is demonstrated on small numerical examples.
    0 references
    mixed constrained nonlinear programming
    0 references
    algorithm
    0 references
    global convergence
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers