Pages that link to "Item:Q2867424"

The following pages link to From global to local convergence of interior methods for nonlinear optimization (Q2867424):

Displaying 29 items.

• Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
• Global and local convergence of a penalty-free method for nonlinear programming (Q493442) (← links)
• An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
• Local convergence of the interior-point Newton method for general nonlinear programming (Q704733) (← links)
• Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
• A note on the use of vector barrier parameters for interior-point methods (Q877030) (← links)
• On the global optimization properties of finite-difference local descent algorithms (Q1207044) (← links)
• Global interval methods for local nonsmooth optimization (Q1292197) (← links)
• Failure of global convergence for a class of interior point methods for nonlinear programming (Q1587941) (← links)
• Local convergence of the affine-scaling interior-point algorithm for nonlinear programming (Q1588839) (← links)
• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods (Q1942268) (← links)
• Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
• Learning to steer nonlinear interior-point methods (Q2175369) (← links)
• A regularization method for constrained nonlinear least squares (Q2191800) (← links)
• An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (Q2358024) (← links)
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
• An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
• Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
• Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers (Q2425163) (← links)
• Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung (Q3783854) (← links)
• (Q3837875) (← links)
• (Q4288940) (← links)
• A Regularized Factorization-Free Method for Equality-Constrained Optimization (Q4641674) (← links)
• A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
• Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q5198049) (← links)
• A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization (Q5268888) (← links)