Pages that link to "Item:Q1424291"
From MaRDI portal
The following pages link to On the convergence of Newton iterations to non-stationary points (Q1424291):
Displaying 28 items.
- On local search in d.c. optimization problems (Q299416) (← links)
- Simple examples for the failure of Newton's method with line search for strictly convex minimization (Q304219) (← links)
- A lower-bound formulation for the geometry and topology optimization of truss structures under multiple loading (Q382021) (← links)
- Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- Nonmonotone filter DQMM method for the system of nonlinear equations (Q548014) (← links)
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers (Q623363) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- A null space method for solving system of equations. (Q1427910) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- An improved line search filter method for the system of nonlinear equations (Q1952809) (← links)
- A nonmonotone line search filter algorithm for the system of nonlinear equations (Q1955426) (← links)
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- Newton methods to solve a system of nonlinear algebraic equations (Q2260664) (← links)
- A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
- Newton's iterates can converge to non-stationary points (Q2465652) (← links)
- An SQP approach with line search for a system of nonlinear equations (Q2473097) (← links)
- A line search filter approach for the system of nonlinear equations (Q2483084) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions (Q2569198) (← links)
- Inner solvers for interior point methods for large scale nonlinear programming (Q2642630) (← links)
- Critical Point-Finding Methods Reveal Gradient-Flat Regions of Deep Network Losses (Q5004367) (← links)
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints (Q5230652) (← links)
- Global and local convergence of a filter line search method for nonlinear programming (Q5436909) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
