A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
type: Item
instance of: scholarly article
title: A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
zbMATH Open document ID: 0770.90049
DOI: 10.1007/BF01371083
author: E. J. Wiest
author: Elijah Polak
published in: Applied Mathematics and Optimization
publication date: 1993-04-01T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 147393
zbMATH Keywords: methods of feasible directions
zbMATH Keywords: constrained optimization
zbMATH Keywords: linear convergence
zbMATH Keywords: rate of convergence
zbMATH Keywords: generalized quadratic program
zbMATH Keywords: globally convergent phase I-phase II algorithm
zbMATH Keywords: inequality-constrained minimization
describes a project that uses: LSSOL
describes a project that uses: GQTPAR
MaRDI profile type: Publication
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: A computational comparison of some non-linear programs
cites work: Q5722776
cites work: On the Pironneau-Polak method of centers
cites work: Constrained Optimization Using a Nondifferentiable Penalty Function
cites work: A Penalty Function Method Converging Directly to a Constrained Optimum
cites work: Exact penalty functions in nonlinear programming
cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization
cites work: Test examples for nonlinear programming codes
cites work: Simplicial decomposition in nonlinear programming algorithms
cites work: Programmation mathématique convexe
cites work: Q5791470
cites work: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
cites work: A surperlinearly convergent algorithm for constrained optimization problems
cites work: Second Order Conditions for Constrained Minima
cites work: Computing a Trust Region Step
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: A Second-order method for the discrete min-max problem
cites work: Some methods of solving convex programming problems
cites work: On the rate of convergence of certain methods of centers
cites work: Q5672476
cites work: Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
cites work: On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
cites work: Combined phase I—phase II methods of feasible directions
cites work: A regularized decomposition method for minimizing a sum of polyhedral functions
cites work: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
cites work: On the rate of convergence of two minimax algorithms
cites work: Q4105489
description: scientific article; zbMATH DE number 147393