The following pages link to Chang-He Liu (Q475707):
Displaying 35 items.
- (Q279832) (redirect page) (← links)
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- A feasible decomposition method for constrained equations and its application to complementarity problems (Q475708) (← links)
- Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function (Q652335) (← links)
- Path-independent \(J\)-integral and its dual form in elastic-plastic solids with finite displacements (Q1307982) (← links)
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
- A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
- Abundant interaction solutions of sine-Gordon equation (Q1952955) (← links)
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
- Inexact operator splitting method for monotone inclusion problems (Q2240103) (← links)
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems (Q2251761) (← links)
- A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787) (← links)
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833) (← links)
- (Q2825059) (← links)
- (Q2860627) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- (Q2886846) (← links)
- (Q2994022) (← links)
- (Q3073050) (← links)
- (Q3462745) (← links)
- (Q4391986) (← links)
- (Q4397869) (← links)
- (Q4489829) (← links)
- (Q4526020) (← links)
- (Q4624418) (← links)
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b><sub>*</sub>(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
- (Q4980694) (← links)
- (Q5318560) (← links)
- (Q5490769) (← links)
- (Q5498112) (← links)
