The following pages link to (Q3680625):
Displayed 10 items.
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
- On Rosen's gradient projection methods (Q917449) (← links)
- A supermemory gradient projection algorithm for optimization problems with nonlinear constraints (Q1210265) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point (Q1920019) (← links)
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)