A line search exact penalty method using steering rules (Q431002): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-010-0408-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-010-0408-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079309016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point algorithms, penalty methods and equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust sequential quadratic programming method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonlinear optimization using linear programming and equality constrained subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Successive Linear-Quadratic Programming Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steering exact penalty methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Convergence of a Filter--SQP Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Derivative SQP Method: Global Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Derivative SQP Method: Local Convergence and Practical Issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Methods for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Convex Risk Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure of global convergence for a class of interior point methods for nonlinear programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-010-0408-0 / rank
 
Normal rank

Latest revision as of 17:23, 9 December 2024

scientific article
Language Label Description Also known as
English
A line search exact penalty method using steering rules
scientific article

    Statements

    A line search exact penalty method using steering rules (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    The article of Richard H. Bryd, Gabriel Lopez-Calva and Jorge Nocedal is a valuable contribution to the field of numerical nonlinear optimization - such to say, another milestone in the series of the authors' contributions to this important area of Applied and Industrial Mathematics and Operational Research. This work impresses by the appropriate, elegant and comfortable use and combination of some basic ideas and principles of optimization theory and numerical mathematics, well directed and eventually proven to be successful. As the authors point out, line search algorithms for nonlinear programming must include safeguards to permit global convergence. This article presents an exact penalization approach which extends the class of problems solvable by a line search sequential quadratic programming algorithm. In the new methods, the penalty parameter is adjusted at every iteration to guarantee sufficient progress in the linear feasibility and to promote acceptance of the step. A trust region is assists in the determination of the penalty parameter, however, not in the step computation. It is shown that the algorithm enjoys favorable global convergence properties. Numerical experiments illustrate the behavior of the algorithm on various difficult situations. The mathematically deep and strong article paper is well-written and well-structured. Problems, formulas, algorithms and tables are put with care, meaningful and with success. The five sections of the paper are as follows: 1. Introduction, 2. A line search penalty method, 3. Convergence analysis, 4. Numerical experiments, and 5. Final remarks. In future, further deep methods and results can be expected, prepared and supported by this research paper. These advances can lead to a great progress in the areas of science, engineering, economics, finance, OR, medicine and healthcare and, herewith, to improvements of the living conditions and expectations of the peoples on earth.
    0 references
    Line search
    0 references
    Sequential quadratic programming
    0 references
    Exact penalty method
    0 references
    Steering rules
    0 references
    Trust region
    0 references
    Convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers