Feasible directions algorithms for optimization problems with equality and inequality constraints

DOI10.1007/BF01580371zbMATH Open0351.90067OpenAlexW2018034520MaRDI QIDQ4121704FDOQ4121704

Authors: Elijah Polak, D. Q. Mayne 

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580371

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Multiplier and gradient methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Title not available (Why is that?)
• An algorithm for optimization problems with functional inequality constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combined Primal-Dual and Penalty Methods for Constrained Minimization
• A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
• A new method for the optimization of a nonlinear function subject to nonlinear constraints

Cited In (24)

• A stochastic algorithm for optimization problems with continua of inequalities
• A first order, exact penalty function algorithm for equality constrained optimization problems
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
• Flattened aggregate function method for nonlinear programming with many complicated constraints
• Computer-aided design via optimization: A review
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
• Optimal fixed rules and simple feedback laws in the design of economic policy
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
• Feasible direction interior-point technique for nonlinear optimization
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Mathematical programming models and algorithms for engineering design optimization
• Preface
• Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
• New convergence theorems for a class of feasible directions algorithms
• A modified SLP algorithm and its global convergence
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• Combined phase I—phase II methods of feasible directions
• A global QP-free algorithm for mathematical programs with complementarity constraints
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
• A note on a globalization of Wilson-type optimization methods
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties

This page was built for publication: Feasible directions algorithms for optimization problems with equality and inequality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121704)