Pages that link to "Item:Q4047415"
From MaRDI portal
The following pages link to Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms (Q4047415):
Displayed 50 items.
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Sequential quadratic programming methods for parametric nonlinear optimization (Q480928) (← links)
- Max-min resource allocation (Q595529) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- On the differentiability of optimal values for bounded nonlinear programs with equality constraints (Q760339) (← links)
- Rates of convergence for adaptive Newton methods (Q802470) (← links)
- Some inverse mapping theorems (Q803303) (← links)
- Parametric sensitivity analysis of perturbed PDE optimal control problems with state and control constraints (Q868572) (← links)
- Newton's method and its use in optimization (Q877590) (← links)
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences (Q1016107) (← links)
- Newton's method for singular constrained optimization problems (Q1057627) (← links)
- A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653) (← links)
- Lipschitz properties of solutions in mathematical programming (Q1078086) (← links)
- Sensitivity analysis in economics (Q1085787) (← links)
- A projected Newton method in a Cartesian product of balls (Q1093537) (← links)
- Computable bounds on parametric solutions of convex problems (Q1106102) (← links)
- A robust secant method for optimization problems with inequality constraints (Q1136347) (← links)
- Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
- On the global and superlinear convergence of a discretized version of Wilson's method (Q1166896) (← links)
- A recursive quadratic programming algorithm for semi-infinite optimization problems (Q1169401) (← links)
- A globally convergent method for nonlinear programming (Q1229804) (← links)
- A second-order method for the general nonlinear programming problem (Q1245156) (← links)
- The Lagrange-Newton method for nonlinear optimal control problems (Q1260624) (← links)
- Degeneracy in NLP and the development of results motivated by its presence (Q1312750) (← links)
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)
- Newton's method for a class of nonsmooth functions (Q1332551) (← links)
- A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
- A robust sequential quadratic programming method (Q1825141) (← links)
- An iterative working-set method for large-scale nonconvex quadratic programming (Q1862010) (← links)
- The Lagrange-Newton method for state constrained optimal control problems (Q1892596) (← links)
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
- An SQP method for optimal control of weakly singular Hammerstein integral equations (Q1913859) (← links)
- A parallel inexact Newton method for stochastic programs with recourse (Q1918424) (← links)
- A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
- Solving Stackelberg equilibrium for multi objective aerodynamic shape optimization (Q1984902) (← links)
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
- Fixed-time control under spatiotemporal and input constraints: a quadratic programming based approach (Q2139434) (← links)
- Superlinear convergence of the sequential quadratic method in constrained optimization (Q2198525) (← links)
- Newton-type methods: a broader view (Q2260691) (← links)
- Stability and sensitivity-analysis for stochastic programming (Q2277142) (← links)
- Exact penalty function algorithm with simple updating of the penalty parameter (Q2277155) (← links)
- Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
- Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions (Q2329659) (← links)
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it (Q2343065) (← links)
- Rejoinder on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it (Q2343066) (← links)
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization (Q2368081) (← links)
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
- Generalized implicit function theorem and its application to parametric optimal control problems (Q2493015) (← links)
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)