Feasible directions algorithms for optimization problems with equality and inequality constraints

DOI10.1007/BF01580371zbMath0351.90067OpenAlexW2018034520MaRDI QIDQ4121704

Elijah Polak, David 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)

Related Items

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

Cites Work

• Multiplier and gradient methods
• 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
• An algorithm for optimization problems with functional inequality constraints
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• A new method for the optimization of a nonlinear function subject to nonlinear constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item