87 results
Search Results
2. A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms.
3. Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming.
4. An augmented Lagrangian affine scaling method for nonlinear programming.
5. Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function.
6. A Study of the Dual Affine Scaling Continuous Trajectories for Linear Programming.
7. An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming
8. A trust region method based on a new affine scaling technique for simple bounded optimization.
9. Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization.
10. An $$O(\sqrt n L)$$ iteration bound primal-dual cone affine scaling algorithm for linear programmingiteration bound primal-dual cone affine scaling algorithm for linear programming.
11. Affine Scaling Methods for Image Deblurring Problems.
12. A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables
13. A CONIC AFFINE SCALING DOGLEG METHOD FOR NONLINEAR OPTIMIZATION WITH BOUND CONSTRAINTS.
14. A Partial First-Order Affine-Scaling Method
15. A POLYNOMIAL PREDICTOR-CORRECTOR TRUST-REGION ALGORITHM FOR LINEAR PROGRAMMING.
16. A NEW ITERATION-COMPLEXITY BOUND FOR THE MTY PREDICTOR-CORRECTOR ALGORITHM.
17. A trust-region and affine scaling algorithm for linearly constrained optimization.
18. Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
19. An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints.
20. An inexact derivative-free Levenberg–Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions.
21. A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints
22. An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization
23. AN AFFINE SCALING INTERIOR ALGORITHM VIA CONJUGATE GRADIENT PATH FOR SOLVING BOUND-CONSTRAINED NONLINEAR SYSTEMS.
24. An affine scaling interior algorithm Via Lanczos path for solving bound-constrained nonlinear systems
25. An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization
26. Feasible region contraction interior point algorithm
27. An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints
28. An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization
29. A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints
30. Superlinear convergence of affine scaling interior point newton method for linear inequality constrained minimization without strict complementarity
31. On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs.
32. An affine scaling algorithm for linear programming problems with inequality constraints.
33. Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming.
34. A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints
35. An Inexact Affine Scaling Levenberg-Marquardt Method Under Local Error Bound Conditions.
36. Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
37. On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems.
38. An affine scaling method for optimization problems with polyhedral constraints.
39. On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds.
40. A trust region affine scaling method for bound constrained optimization.
41. A first-order interior-point method for linearly constrained smooth optimization.
42. ON A CLASS OF SUPERLINEARLY CONVERGENT POLYNOMIAL TIME INTERIOR POINT METHODS FOR SUFFICIENT LCP.
43. An affine scaling interior trust region method via optimal path for solving monotone variational inequality problem with linear constraints.
44. Nonmonotonic Reduced Projected Hessian Method Via an Affine Scaling Interior Modified Gradient Path for Bounded-Constrained Optimization.
45. PRIMAL-DUAL AFFINE SCALING INTERIOR POINT METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS.
46. An interior-point affine-scaling trust-region method for semismooth equations with box constraints.
47. On Affine-Scaling Interior-Point Newton Methods for Nonlinear Minimization with Bound Constraints.
48. CONSTRAINT REDUCTION FOR LINEAR PROGRAMS WITH MANY INEQUALITY CONSTRAINTS.
49. An interior global method for nonlinear systems with simple bounds.
50. Design and Hybrid Realization of FIR Nyquist Filters with Quantized Coefficients and Low Sensitivity to Timing Jitter.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.