The following pages link to Zhang, Jianzhong (Q161457):
Displaying 50 items.
- (Q170744) (redirect page) (← links)
- (Q226135) (redirect page) (← links)
- (Q540646) (redirect page) (← links)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- Active set algorithm for mathematical programs with linear complementarity constraints (Q545973) (← links)
- Modified extragradient method for variational inequalities and verification of solution existence (Q597166) (← links)
- Convergence and error bound of a method for solving variational inequality problems via the generalized D-gap function (Q597189) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041) (← links)
- Inverse center location problem on a tree (Q732826) (← links)
- A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone (Q814939) (← links)
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case (Q850828) (← links)
- A modified quasi-Newton method for structured optimization with partial information on the Hessian (Q853668) (← links)
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← links)
- A theoretical analysis on efficiency of some Newton-PCG methods (Q882949) (← links)
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm (Q883285) (← links)
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822) (← links)
- Projected quasi-Newton algorithm with trust region for constrained optimization (Q911465) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- The inverse 1-median problem on a cycle (Q951097) (← links)
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem (Q953410) (← links)
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization (Q987521) (← links)
- An augmented Lagrangian method for a class of Inverse quadratic programming problems (Q989969) (← links)
- Two error bounds for constrained optimization problems and their applications (Q1021250) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Superlinear convergence of a trust region type successive linear programming method (Q1102881) (← links)
- Analysis and design of fault-tolerant capability of single-stage interconnect ion network RMISE (Q1119548) (← links)
- On the duality of generalized geometric programming (Q1207244) (← links)
- Modified partial-update Newton-type algorithms for unary optimization (Q1265009) (← links)
- Trust region dogleg path algorithms for unconstrained minimization (Q1290213) (← links)
- Inexact generalized Newton methods for second order \(C\)-differentiable optimization (Q1298488) (← links)
- Inverse problem of minimum cuts (Q1298756) (← links)
- A further study on inverse linear programming problems (Q1298792) (← links)
- Solution structure of some inverse combinatorial optimization problems (Q1304391) (← links)
- Scaled optimal path trust-region algorithm (Q1306663) (← links)
- New quasi-Newton equation and related methods for unconstrained optimization (Q1306664) (← links)
- A projected indefinite dogleg path method for equality constrained optimization (Q1307246) (← links)
- A priority measure in interval methods for constrained global optimization (Q1321801) (← links)
- A convergent secant method for constrained optimization (Q1335568) (← links)
- A projective quasi-Newton method for nonlinear optimization (Q1344341) (← links)
- Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis (Q1367810) (← links)
- Inverse maximum capacity problems (Q1387947) (← links)
- The dual gap function for variational inequalities (Q1416674) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- On inverse problems of optimum perfect matching (Q1417847) (← links)
- Identification of the optimal active set in a noninterior continuation method for LCP (Q1422880) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities (Q1430272) (← links)