A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
From MaRDI portal
Recommendations
- A feasible sequential systems of linear equations algorithm for inequality constrained optimization
- A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
Cited in
(30)- A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- The use of QP-free algorithm in the limit analysis of slope stability
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
- Newton-KKT interior-point methods for indefinite quadratic programming
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- A feasible sequential systems of linear equations algorithm for inequality constrained optimization
- scientific article; zbMATH DE number 5031884 (Why is no real title available?)
- An improved feasible QP-free algorithm for inequality constrained optimization
- An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A global QP-free algorithm for mathematical programs with complementarity constraints
- Duality in convex optimization for the hyperbolic augmented Lagrangian
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- A globally convergent QP-free algorithm for inequality constrained minimax optimization
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
This page was built for publication: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441945)
