Corpus ID: 19004293

NLP Solutions as Asymptotic Values of ODE Trajectories

  title={NLP Solutions as Asymptotic Values of ODE Trajectories},
  author={M. Alamir},
  • M. Alamir
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
In this paper, it is shown that the solutions of general differentiable constrained optimization problems can be viewed as asymptotic solutions to sets of Ordinary Differential Equations (ODEs). The construction of the ODE associated to the optimization problem is based on an exact penalty formulation in which the weighting parameter dynamics is coordinated with that of the decision variable so that there is no need to solve a sequence of optimization problems, instead, a single ODE has to be… Expand


Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
  • 47
  • Highly Influential
  • PDF
Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method
  • 212
Constrained model predictive control: Stability and optimality
  • 6,790
Introductory Lectures on Convex Optimization - A Basic Course
  • 4,188
An Interior Point Algorithm for Large-Scale Nonlinear Programming
  • 1,268
  • PDF
Algorithm 658: ODESSA–an ordinary differential equation solver with explicit simultaneous sensitivity analysis
  • 107
Block predictor-corrector schemes for the parallel solution of ODEs
  • 35
Noninteracting electronically tunable CCII-based current-mode biquadratic filters
  • 53
Realization of voltage and current-mode transfer functions using unitygain cells
  • 21
Level-Shifting Multiple-Input Switched-Capacitor Voltage Copier
  • 45