A stable approach to Newton's method for general mathematical programming problems in R^n
From MaRDI portal
Publication:2264405
Cites work
Cited in
(13)- A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Differential dynamic programming and separable programs
- Discriminant analysis and density estimation on the finite d-dimensional grid
- A second-order method for the general nonlinear programming problem
- The use of squared slack variables in nonlinear second-order cone programming
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Variants of the reduced Newton method for nonlinear equality constrained optimization problems
- On a Newton-like method for constrained nonlinear minimization via slack variables
- A projected gradient and constraint linearization method for nonlinear model predictive control
- A Homotopy based approach to unconstrained optimization
- An algorithm for optimal single linear feature extraction from several gaussian pattern classes
- A primal-dual Newton-type algorithm for geometric programs with equality constraints
This page was built for publication: A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264405)