Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
From MaRDI portal
Publication:4047415
Cites work
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3422205 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- A quadratically-convergent algorithm for general nonlinear programming problems
- A sufficient condition for continuity of optimal sets in mathematical programming
- Computational experience in sensitivity analysis for nonlinear programming
- Iterative Solution of Nonlinear Optimal Control Problems
- On the continuity of the minimum set of a continuous function
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
- Recursive Decision Systems: An Existence Analysis
- Sensitivity analysis for nonlinear programming using penalty methods
- Stability in Nonlinear Programming
- The Validity of a Family of Optimization Methods
Cited in
(76)- Sensitivity analysis for nonlinear programming using penalty methods
- Solving Stackelberg equilibrium for multi objective aerodynamic shape optimization
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
- A projected Newton method in a Cartesian product of balls
- Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions
- A parallel inexact Newton method for stochastic programs with recourse
- Applications of the method of partial inverses to convex programming: Decomposition
- Estimates for Kuhn-Tucker points of perturbed convex programs
- A robust sequential quadratic programming method
- Lipschitz properties of solutions in mathematical programming
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
- Degeneracy in NLP and the development of results motivated by its presence
- Superlinearly convergent algorithm for min-max problems
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Computable bounds on parametric solutions of convex problems
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- Global and local convergence of a filter line search method for nonlinear programming
- A globally convergent method for nonlinear programming
- A superlinearly convergent method of feasible directions.
- A superlinearly convergent numerical algorithm for nonlinear programming
- A second-order method for the general nonlinear programming problem
- A globally convergent algorithm for nonlinearly constrained optimization problems
- The Lagrange-Newton method for state constrained optimal control problems
- Exponential decay of sensitivity in graph-structured nonlinear programs
- Max-min resource allocation
- A new SQP method of feasible directions for nonlinear programming.
- Fixed-time control under spatiotemporal and input constraints: a quadratic programming based approach
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Enlarging the region of convergence of Newton's method for constrained optimization
- A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Sensitivity and stability analysis for nonlinear programming
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- Stability and sensitivity-analysis for stochastic programming
- An SQP method for optimal control of weakly singular Hammerstein integral equations
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Inexact Newton-type optimization with iterated sensitivities
- Newton's method and its use in optimization
- Exact penalty function algorithm with simple updating of the penalty parameter
- Inexact Newton methods for the nonlinear complementarity problem
- On the differentiability of optimal values for bounded nonlinear programs with equality constraints
- Sensitivity analysis in economics
- Convergence analysis of the semismooth Newton method for sparse control problems governed by semilinear elliptic equations
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Rejoinder on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Sequential quadratic programming methods for parametric nonlinear optimization
- Parametric sensitivity analysis of perturbed PDE optimal control problems with state and control constraints
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Superlinear convergence of the sequential quadratic method in constrained optimization
- Direct optimal control and model predictive control
- Some inverse mapping theorems
- A robust secant method for optimization problems with inequality constraints
- Generalized implicit function theorem and its application to parametric optimal control problems
- Newton-type methods: a broader view
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- Sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Substitution secant/finite difference method to large sparse minimax problems
- Rates of convergence for adaptive Newton methods
- Newton's method for a class of nonsmooth functions
- An iterative working-set method for large-scale nonconvex quadratic programming
- On the global and superlinear convergence of a discretized version of Wilson's method
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- The linearization method
- The lagrange-newton method for infinite-dimensional optimization problems
- Newton's method for singular constrained optimization problems
- Convergence of algorithms for perturbed optimization problems
- A special newton-type optimization method
- The Lagrange-Newton method for nonlinear optimal control problems
This page was built for publication: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047415)
