The following pages link to Jean-Pierre Dussault (Q195213):
Displaying 42 items.
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- High-order Newton-penalty algorithms (Q557745) (← links)
- Combining the stochastic counterpart and stochastic approximation methods (Q679024) (← links)
- Local path-following property of inexact interior methods in nonlinear programming (Q694602) (← links)
- (Q748599) (redirect page) (← links)
- A globally convergent algorithm for MPCC (Q748600) (← links)
- (Q850822) (redirect page) (← links)
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming (Q850824) (← links)
- Penalty algorithms in Hilbert spaces (Q884882) (← links)
- A note on a globally convergent Newton method for solving monotone variational inequalities (Q1091770) (← links)
- Construction of Voronoi polyhedra (Q1251944) (← links)
- (Q1338553) (redirect page) (← links)
- Stable exponential-penalty algorithm with superlinear convergence (Q1338554) (← links)
- Convergence of implementable descent algorithms for unconstrained optimization (Q1573997) (← links)
- A note on robust descent in differentiable optimization (Q1728324) (← links)
- Augmented non-quadratic penalty algorithms (Q1881044) (← links)
- Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
- The Chebyshev-Shamanskii method for solving systems of nonlinear equations (Q1955568) (← links)
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
- On approximate stationary points of the regularized mathematical program with complementarity constraints (Q2194126) (← links)
- Solving trajectory optimization problems via nonlinear programming: the brachistochrone case study (Q2357837) (← links)
- Implementation issues for high-order algorithms (Q2390723) (← links)
- A smoothing heuristic for a bilevel pricing problem (Q2503215) (← links)
- Improved convergence order for augmented penalty algorithms (Q2655402) (← links)
- (Q2715904) (← links)
- A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities (Q3032098) (← links)
- Robust descent in differentiable optimization using automatic finite differences (Q3423594) (← links)
- La différentiation automatique et son utilisation en optimisation (Q3539805) (← links)
- Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications (Q3539806) (← links)
- Convex quadratic programming with one constraint and bounded variables (Q3771973) (← links)
- Conditions de régularité géométrique pour les inéquations variationnelles (Q3816924) (← links)
- Augmented penalty algorithms (Q3840700) (← links)
- Pénalités mixtes : un algorithme superlinéaire en deux étapes (Q4284116) (← links)
- Numerical Stability and Efficiency of Penalty Algorithms (Q4326873) (← links)
- (Q4362982) (← links)
- (Q4372886) (← links)
- (Q4463234) (← links)
- (Q4495133) (← links)
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method (Q4634163) (← links)
- ARC<sub>q</sub>: a new adaptive regularization by cubics (Q4638924) (← links)
- A two parameter mixed interior-exterior penalty algorithm (Q4698118) (← links)
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution (Q6038669) (← links)
