A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A surperlinearly convergent algorithm for constrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust sequential quadratic programming method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On combining feasibility, descent and superlinear convergence in inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2746550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Accurate Identification of Active Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential systems of linear equations method for general constrained optimization without strict complementarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-free constrained Newton-type method for variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Regular Generalized Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: More test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank

Revision as of 02:18, 29 June 2024

scientific article
Language Label Description Also known as
English
A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
scientific article

    Statements

    A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (English)
    0 references
    0 references
    0 references
    2 March 2009
    0 references
    The following nonlinear inequality constrained optimization problem is considered: \[ \text{Minimize }f(x)\text{ subject to }g_i(x)\leq 0,\;i=1, \dots, m, \] where \(f:\mathbb{R}^n\to \mathbb{R}\), \(g_i:\mathbb{R}^n\to \mathbb{R}\) for all \(i=1,\dots,m\) are continuously differentiable functions. Using a new identification technique of active constraints and the method of strongly sub-feasible directions, the authors develop a new algorithm based on a sequential system of linear equations. The algorithm can be started from an arbitrary initial point. After a finite number of iterations, the algorithm generates a feasible iteration point and continues its work as the known method of feasible directions. Global, strong and superlinear convergence of the proposed algorithm are proved. Experimental numerical results in the concluding part of the paper show the effectiveness of the algorithm.
    0 references
    inequality constraints
    0 references
    nonlinear optimization
    0 references
    sequential systems of linear equations
    0 references
    working set
    0 references
    global and superlinear convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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