Search

Showing total 21 results
21 results

Search Results

1. Globally Convergent Optimization Algorithms on Riemannian Manifolds: Uniform Framework for Unconstrained and Constrained Optimization.

2. Sequential Penalty Algorithm for Nonlinear Constrained Optimization.

3. Refined saddle-point preconditioners for discretized Stokes problems.

4. Some sufficient conditions for convergent multivariate subdivision schemes with nonnegative finite masks.

5. Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization.

6. Hybrid differential evolution and Nelder-Mead algorithm with re-optimization.

7. Generating and measuring instances of hard semidefinite programs.

8. Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization.

9. Strong Convergence of Iterative Algorithms for Variational Inequalities in Banach Spaces.

10. On convergent numerical algorithms for unsymmetric collocation.

11. A hybrid extragradient method for general variational inequalities.

12. Probability-one homotopy maps for mixed complementarity problems.

13. On n-term approximation with positive coefficients.

14. A projection method for a system of nonlinear monotone equations with convex constraints.

15. An Improved Extra-Gradient Method for Minimizing a Sum of p-norms—A Variational Inequality Approach.

16. The Lagrangian Globalization Method for Nonsmooth Constrained Equations.

17. Weak sharp minima revisited, part II: application to linear regularity and error bounds.

18. Superlinear Convergence of a Newton-Type Algorithm for Monotone Equations.

19. Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming.

20. Globally and Quadratically Convergent Algorithm for Minimizing the Sum of Euclidean Norms.

21. Forcing strong convergence of proximal point iterations in a Hilbert space.