( en | de | ru )

 

Disambiguation of "bao Jian, Jin"

Author of the publication

copydeleteadd this publication to your clipboard
Inverse problems and solution methods for a class of nonlinear complementarity problems.

, , and . Comput. Optim. Appl., 49 (2): 271-297 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jin Bao

Wenwen Bao

Mohammed Subhiy Husein al- Baouni

Feng Bao

Huixin Bao

 

Other publications of authors with the same name

Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints., , and . J. Glob. Optim., 29 (1): 59-83 (2004)A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization., , and . Comput. Math. Appl., 58 (8): 1520-1533 (2009)Finitely Convergent Algorithms of Generalized Gradient Projection for Systems of Nonlinear Inequalities., and . Neural Parallel & Scientific Comp., 12 (2): 207-218 (2004)Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions., , and . Eur. J. Oper. Res., 200 (3): 645-657 (2010)A new norm-relaxed SQP algorithm with global convergence., , , and . Appl. Math. Lett., 23 (6): 670-675 (2010)A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences., , and . J. Comput. Appl. Math., (2014)Inverse problems and solution methods for a class of nonlinear complementarity problems., , and . Comput. Optim. Appl., 49 (2): 271-297 (2011)A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization., , , and . Numer. Algorithms, 65 (1): 1-22 (2014)A working set SQCQP algorithm with simple nonmonotone penalty parameters., , and . J. Comput. Appl. Math., 236 (6): 1382-1398 (2011)A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems., , , and . Appl. Math. Comput., (2014)