36 results on '"Goffin, J.-L."'
Search Results
2. On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities
3. The Relaxation Method for Solving Systems of Linear Inequalities
4. Decomposition and Nondifferentiable Optimization with the Projective Algorithm
5. On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability
6. Primal–Dual–Infeasible Newton Approach for the Analytic Center Deep-Cutting Plane Method
7. On Improvements to the Analytic Center Cutting Plane Method
8. Long-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators
9. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
10. A cutting plane method from analytic centers for stochastic programming
11. On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
12. Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
13. Cutting planes and column generation techniques with the projective algorithm
14. Using central prices in the decomposition of linear programs
15. Affine and projective transformations in nondifferentiable optimization
16. On the characterization and the computation of the characteristic function of a game without side payments
17. A primal–dual regularized interior-point method for semidefinite programming
18. On convergence rates of subgradient optimization methods
19. On the non-polynomiality of the relaxation method for systems of linear inequalities
20. Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
21. A primal–dual regularized interior-point method for semidefinite programming.
22. A Lagrangian Relaxation of the Capacited Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm
23. A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
24. Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
25. Convergence Rates of the Ellipsoid Method on General Convex Functions
26. An analytic center cutting plane method for pseudomonotone variational inequalities
27. Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
28. Conjugate gradient methods for linearly constrained nonlinear programming
29. Asymptotic properties of reduction methods applying linearly equality constrained reduced problems
30. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
31. Determining feasibility of a set of nonlinear inequality constraints
32. On some experiments which delimit the utility of nonlinear programming methods for engineering design
33. Computation of the search direction in constrained optimization algorithms
34. A surperlinearly convergent algorithm for constrained optimization problems
35. Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
36. The watchdog technique for forcing convergence in algorithms for constrained optimization
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.