A two-stage feasible directions algorithm for nonlinear constrained optimization

From MaRDI portal
Publication:3762086

DOI10.1007/BF02591987zbMath0623.90070MaRDI QIDQ3762086

José Herskovits

Publication date: 1986

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




Related Items

Real and Integer Extended Rank Reduction Formulas and Matrix Decompositions: A Review, 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, Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions, A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point, A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, Damping optimization of viscoelastic laminated sandwich composite structures, A feasible directions method for nonsmooth convex optimization, Newton-KKT interior-point methods for indefinite quadratic programming, An interior point algorithm for mixed complementarity nonlinear problems, 3D-FEM formulations of limit analysis methods for porous pressure-sensitive materials, A nonlinear programming algorithm for finite element limit analysis using feasible arc searching technique, An improved feasible QP-free algorithm for inequality constrained optimization, Upper bound limit analysis using linear finite elements and non-linear programming, Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems., An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems, Flattened aggregate function method for nonlinear programming with many complicated constraints, A control problem arising in the process of waste water purification, Limit analysis and convex programming: A decomposition approach of the kinematic mixed method, An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, General-sum stochastic games: verifiability conditions for Nash equilibria, An improved sequential quadratic programming algorithm for solving general nonlinear programming problems, Newton-type methods: a broader view, Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, Mathematical programming models and algorithms for engineering design optimization, A feasible interior-point algorithm for nonconvex nonlinear programming, Global and local convergence of a filter line search method for nonlinear programming, Some Applications of Optimal Control Theory of Distributed Systems, Feasible direction interior-point technique for nonlinear optimization, A generalization of the norm-relaxed method of feasible directions, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, Large static problem in numerical limit analysis: A decomposition approach



Cites Work