The following pages link to (Q4950903):
Displaying 14 items.
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
- Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems (Q884390) (← links)
- A new finitely convergent algorithm for systems of nonlinear inequalities (Q1001117) (← links)
- A variant of the Topkis-Veinott method for solving inequality constrained optimization problems (Q1568186) (← links)
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812) (← links)
- A generalized project metric algorithm for mathematical programs with equilibrium constraints (Q2349543) (← 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)
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
- A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization (Q2915929) (← links)
- (Q4037898) (← links)
- (Q4719027) (← links)
