Result 1 to 20 of 44 total
New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems. (English)
Appl. Math. Comput. 217, No. 23, 9723-9740 (2011).
1
An augmented Lagrangian fish swarm based method for global optimization. (English)
J. Comput. Appl. Math. 235, No. 16, 4611-4620 (2011).
2
Random orthogonal matrix simulation. (English)
Linear Algebra Appl. 434, No. 6, 1444-1467 (2011).
3
A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem. (English)
Appl. Math. Comput. 217, No. 9, 4459-4472 (2011).
4
Clarkson’s algorithm for violator spaces. (English)
Comput. Geom. 44, No. 2, 70-81 (2011).
5
Optimal learning rates for least squares regularized regression with unbounded sampling. (English)
J. Complexity 27, No. 1, 55-67 (2011).
6
On simulating univariate and multivariate Burr type III and type XII distributions. (English)
Appl. Math. Sci., Ruse 4, No. 45-48, 2207-2240 (2010).
7
A comparison of error bounds for linear complementarity problems of $H$-matrices. (English)
Linear Algebra Appl. 433, No. 5, 956-964 (2010).
8
A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities. (English)
Appl. Math. Comput. 216, No. 10, 3056-3063 (2010).
9
New extragradient-type methods for solving variational inequalities. (English)
Appl. Math. Comput. 216, No. 8, 2430-2440 (2010).
10
Global optimization for sum of geometric fractional functions. (English)
Appl. Math. Comput. 216, No. 8, 2263-2270 (2010).
11
Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations. (English)
Numer. Math. 115, No. 2, 309-331 (2010).
12
A projection-filter method for solving nonlinear complementarity problems. (English)
Appl. Math. Comput. 216, No. 1, 300-307 (2010).
13
A parameter free filled function for unconstrained global optimization. (English)
Appl. Math. Comput. 215, No. 10, 3610-3619 (2010).
14
A type of efficient feasible SQP algorithms for inequality constrained optimization. (English)
Appl. Math. Comput. 215, No. 10, 3589-3598 (2010).
15
An algorithm based on the generalized D-gap function for equilibrium problems. (English)
J. Comput. Appl. Math. 231, No. 1, 403-411 (2009).
16
The convergence of subspace trust region methods. (English)
J. Comput. Appl. Math. 231, No. 1, 365-377 (2009).
17
A SQP algorithm based on a smoothing lower order penalty function for inequality constrained optimization. (English)
J. Comput. Anal. Appl. 11, No. 3, 481-491 (2009).
18
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. (English)
Math. Program. 119, No. 2 (A), 239-271 (2009).
19
A regularized smoothing Newton method for symmetric cone complementarity problems. (English)
SIAM J. Optim. 19, No. 3, 1028-1047 (2008).
20
Result 1 to 20 of 44 total
Start
Contact
Print
General Help
