The following pages link to Xing-Si Li (Q940084):
Displayed 50 items.
- (Q381493) (redirect page) (← links)
- A gradient-based approach for discrete optimum design (Q381494) (← links)
- A log-exponential smoothing method for mathematical programs with complementarity constraints (Q434603) (← links)
- An infeasible-start path-following method for monotone LCPs (Q597439) (← links)
- Solving frictional contact problems by two aggregate-function-based algorithms (Q608652) (← links)
- Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
- A smoothing method for zero--one constrained extremum problems (Q637567) (← links)
- Lagrangian regularization approach to constrained optimization problems (Q703420) (← links)
- A self-adjusting interior point algorithm for linear complementarity problems (Q814067) (← links)
- Nonsmooth model for plastic limit analysis and its smoothing algorithm (Q940085) (← links)
- An aggregate function method for nonlinear programming (Q1201568) (← links)
- An efficient approach to nonlinear minimax problems (Q1203873) (← links)
- A smooth quasi-exact penalty function for nonlinear programming (Q1203874) (← links)
- An efficient approach to a class of non-smooth optimization problems (Q1326996) (← links)
- On the entropic regularization method for solving min-max problems with applications (Q1366322) (← links)
- Solving inverse viscoelasticity problems via aggregate function approach. (Q1422979) (← links)
- Unilateral contact problems using quasi-active set strategy. (Q1864014) (← links)
- Non-interior smoothing algorithm for frictional contact problems (Q1890318) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- New smooth gap function for box constrained variational inequalities (Q2376210) (← links)
- A new algorithm for numerical solution of 3D elastoplastic contact problems with orthotropic friction law (Q2386751) (← links)
- An efficient algorithm for the Euclidean \(r\)-centrum location problem (Q2570749) (← links)
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- (Q2916063) (← links)
- (Q2991721) (← links)
- (Q3014075) (← links)
- (Q3014577) (← links)
- (Q3016788) (← links)
- (Q3052442) (← links)
- (Q3109407) (← links)
- (Q3366243) (← links)
- (Q3403778) (← links)
- (Q3441551) (← links)
- (Q3469815) (← links)
- (Q3500774) (← links)
- (Q3571167) (← links)
- (Q3571171) (← links)
- (Q3571600) (← links)
- (Q3572377) (← links)
- An Aggregate Constraint Method for Non-Linear Programming (Q3984311) (← links)
- (Q4239907) (← links)
- (Q4416030) (← links)
- (Q4446144) (← links)
- (Q4513089) (← links)
- A self-adjusting primal–dual interior point method for linear programs (Q4657821) (← links)
- (Q4782763) (← links)
- (Q4821752) (← links)
- (Q4885058) (← links)
- (Q4900817) (← links)