Two-phase model algorithm with global convergence for nonlinear programming

DOI10.1023/A:1022626332710zbMath0905.90160OpenAlexW1575288039MaRDI QIDQ1389083

José Mario Martínez

Publication date: 11 June 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022626332710

zbMATH Keywords

global convergencemerit functiontrust regionsnonlinear constraintssequential gradient restoration algorithmgeneralized reduced gradientfeasible methods for minimizationnonlinear projected gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, An inexact-restoration method for nonlinear bilevel programming problems, Solution Of Bounded Nonlinear Systems Of Equations Using Homotopies With Inexact Restoration, The demand adjustment problem via inexact restoration method, A practical optimality condition without constraint qualifications for nonlinear programming, New condition characterizing the solutions of variational inequality problems, Inexact-restoration algorithm for constrained optimization, Inexact restoration method for nonlinear optimization without derivatives, An investigation of the use of three selection-based genetic algorithm families when minimizing the production cost of hollow core slabs, Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming., Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods
• Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis
• A trust region algorithm for equality constrained optimization
• A new trust region algorithm for bound constrained minimization
• A trust-region strategy for minimization on arbitrary domains
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems
• A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Inexact Newton Methods
• Large-scale linearly constrained optimization
• A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
• A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints