Inexact Newton-type optimization with iterated sensitivities
From MaRDI portal
Publication:4600840
Recommendations
- Adjoint-based algorithms and numerical methods for sensitivity generation and optimization of large scale dynamic systems.
- Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms
- Optimal sensitivity based on IPOPT
- An improved inexact Newton method
- Inexactness Issues in the Lagrange-Newton-Krylov-Schur Method for PDE-constrained Optimization
Cites work
- scientific article; zbMATH DE number 3816970 (Why is no real title available?)
- scientific article; zbMATH DE number 4009690 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- scientific article; zbMATH DE number 1456803 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
- A direct method for the numerical solution of optimization problems with time-periodic PDE constraints.
- A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints
- A parallel quadratic programming method for dynamic optimization problems
- A quadratically convergent inexact SQP method for optimal control of differential algebraic equations
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
- An Efficient Solution Process for Implicit Runge–Kutta Methods
- An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
- An auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- Analysis of inexact trust-region SQP algorithms
- Constrained optimal feedback control of systems governed by large differential algebraic equations
- Global convergence of inexact reduced sqp methods
- Implementation of high-order implicit Runge-Kutta methods
- Inexact Newton Methods
- Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
- Iterative schemes for three-stage implicit Runge-Kutta methods
- Large-scale PDE-constrained optimization
- Lifted collocation integrators for direct optimal control in ACADO toolkit
- Newton methods for nonlinear problems. Affine invariance and adaptive algorithms.
- Nonlinear Programming
- Numerical experiments with an inexact Jacobian trust-region algorithm
- Numerical simulation methods for embedded optimization
- On Newton-like methods
- On constrained optimization by adjoint based quasi-Newton methods
- On the implementation of implicit Runge-Kutta methods
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
- Practical shape optimization for turbine and compressor blades by the use of PRSQP methods
- Quasi-Newton Methods, Motivation and Theory
- Some schemes for the implementation of implicit Runge-Kutta methods
- The lifted Newton method and its application in optimization
- \texttt{ACADO toolkit} -- an open-source framework for automatic control and dynamic optimization
- qpOASES: a parametric active-set algorithm for~quadratic programming
Cited in
(12)- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control
- Adjoint-based algorithms and numerical methods for sensitivity generation and optimization of large scale dynamic systems.
- Newton-type methods for non-convex optimization under inexact Hessian information
- Inexactly constrained discrete adjoint approach for steepest descent-based optimization algorithms
- Efficient delay and parameter estimation for nonlinear systems based on lifted IRK integrators with inexact Jacobians
- Direct optimal control for time-delay systems via a lifted multiple shooting algorithm
- Solving quadratic programs to high precision using scaled iterative refinement
- New results for the handling of additional equality constraints in one-shot optimization
- The lifted Newton method and its application in optimization
- Lifted collocation integrators for direct optimal control in ACADO toolkit
- Inexact generalized Newton methods for second order \(C\)-differentiable optimization
Describes a project that uses
Uses Software
This page was built for publication: Inexact Newton-type optimization with iterated sensitivities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600840)
