Pages that link to "Item:Q5317518"
From MaRDI portal
The following pages link to An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence (Q5317518):
Displayed 35 items.
- A stabilized filter SQP algorithm for nonlinear programming (Q312472) (← links)
- Model-based principal components of correlation matrices (Q391551) (← links)
- Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions (Q393377) (← links)
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions (Q403631) (← links)
- Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
- Stabilized SQP revisited (Q431014) (← links)
- A primal-dual augmented Lagrangian (Q434173) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- Sequential quadratic programming methods for parametric nonlinear optimization (Q480928) (← links)
- A stabilized SQP method: superlinear convergence (Q526843) (← links)
- An optimization method for overdetermined kinematic problems formulated with natural coordinates (Q649544) (← links)
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints (Q842762) (← links)
- Combining stabilized SQP with the augmented Lagrangian algorithm (Q887169) (← links)
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions (Q959974) (← links)
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems (Q1942263) (← links)
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems (Q1960188) (← links)
- Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications (Q2080828) (← links)
- On the cost of solving augmented Lagrangian subproblems (Q2191763) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Locally polynomial method for solving systems of linear inequalities (Q2206481) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
- Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← links)
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems (Q2434995) (← links)
- A Globally Convergent LP-Newton Method (Q2826818) (← links)
- A Regularized Factorization-Free Method for Equality-Constrained Optimization (Q4641674) (← links)
- A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
- Adjusting Dual Iterates in the Presence of Critical Lagrange Multipliers (Q5114397) (← links)
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization (Q5268888) (← links)
- The<i>p</i>-Factor-Lagrange Methods for Degenerate Nonlinear Programming (Q5452406) (← links)
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods (Q5880389) (← links)
- Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions (Q5963679) (← links)
- Simultaneous Identification and Denoising of Dynamical Systems (Q6113941) (← links)
- Newton-type methods for constrained optimization with nonregular constraints (Q6122341) (← links)
- Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization (Q6136653) (← links)