A two-stage feasible directions algorithm for nonlinear constrained optimization
From MaRDI portal
Publication:3762086
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3874966 (Why is no real title available?)
- scientific article; zbMATH DE number 3706045 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- A Matrix Modification Method for Calculating Approximate Solutions to Systems of Linear Equations
- A globally convergent method for nonlinear programming
- Algorithms for nonlinear constraints that use lagrangian functions
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- La méthode des centres dans un espace topologique
- Nonlinear leastpth optimization and nonlinear programming
- On Penalty and Multiplier Methods for Constrained Minimization
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Test examples for nonlinear programming codes
Cited in
(37)- scientific article; zbMATH DE number 1925785 (Why is no real title available?)
- An improved feasible QP-free algorithm for inequality constrained optimization
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A generalization of the norm-relaxed method of feasible directions
- An interior point algorithm for mixed complementarity nonlinear problems
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- Limit analysis and convex programming: a decomposition approach of the kinematic mixed method
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
- A feasible interior-point algorithm for nonconvex nonlinear programming
- A feasible direction algorithm for nonlinear second-order cone programs
- Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
- 3D-FEM formulations of limit analysis methods for porous pressure-sensitive materials
- Newton-KKT interior-point methods for indefinite quadratic programming
- Large static problem in numerical limit analysis: a decomposition approach
- Real and integer extended rank reduction formulas and matrix decompositions: A review
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Upper bound limit analysis using linear finite elements and non-linear programming
- Damping optimization of viscoelastic laminated sandwich composite structures
- A feasible directions method for nonsmooth convex optimization
- Global and local convergence of a filter line search method for nonlinear programming
- 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 globally and superlinearly convergent feasible QP-free method for nonlinear programming
- Mathematical programming models and algorithms for engineering design optimization
- Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- Some Applications of Optimal Control Theory of Distributed Systems
- General-sum stochastic games: verifiability conditions for Nash equilibria
- Newton-type methods: a broader view
- A nonlinear programming algorithm for finite element limit analysis using feasible arc searching technique
- A Two-Riccati, Feasible Algorithm for Guaranteeing Output L∞ Constraints
- Feasible direction interior-point technique for nonlinear optimization
- 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
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A control problem arising in the process of waste water purification
This page was built for publication: A two-stage feasible directions algorithm for nonlinear constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762086)
