Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control

DOI10.1007/S10013-024-00704-ZMaRDI QIDQ6952466zbMATH OpenFDO

Authors Armin Nurkanović, Anton Pozharskiy, Moritz Diehl

Publication date 27 July 2025

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10013-024-00704-Z

zbMATH Keywords

benchmarkMPECsnonlinear programmingoptimal control

Mathematics Subject Classification ID

Numerical methods in optimal control (49M99) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• A high accuracy method for solving ODEs with discontinuous right-hand side
• A line search exact penalty method using steering rules
• A modified relaxation scheme for mathematical programs with complementarity constraints
• A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• A new regularization scheme for mathematical programs with complementarity constraints
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• A numerical method for friction problems with multiple contacts
• A penalized Fischer-Burmeister NCP-function
• A smoothing method for mathematical programs with equilibrium constraints
• Abadie-type constraint qualification for mathematical programs with equilibrium constraints
• Algorithm 968: DISODE45: a Matlab Runge-Kutta solver for piecewise smooth IVPs of Filippov type
• An event-driven method to simulate Filippov systems with accurate computing of sliding motions
• An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
• Benchmarking optimization software with performance profiles.
• CasADi: a software framework for nonlinear optimization and optimal control
• Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
• Complementarity constraints as nonlinear equations: Theory and numerical experience
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• Dynamical systems coupled with monotone set-valued operators: formalisms, applications, well-posedness, and stability
• Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
• Evolution problem associated with a moving convex set in Hilbert space
• FESD-J: Finite Elements with Switch Detection for Numerical Optimal Control of Rigid Bodies with Impacts and Coulomb Friction
• Finite elements with switch detection for direct optimal control of nonsmooth systems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
• Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
• Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Interior-point algorithms, penalty methods and equilibrium problems
• LCQPow: a solver for linear complementarity quadratic programs
• Lifting mathematical programs with complementarity constraints
• Limit cycles with chattering in relay feedback systems
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
• Methods for convex and general quadratic programming
• MPEC methods for bilevel optimization problems
• Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Newton-Type Methods for Optimization and Variational Problems
• Nonlinear programming without a penalty function.
• On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints
• Optimal control of systems with discontinuous differential equations
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
• Projected dynamical systems in a complementarity formalism
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• Sequential linearization method for bound-constrained mathematical programs with complementarity constraints
• Simultaneous enforcement of constraints at position and velocity levels in the nonsmooth generalized- scheme
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Solving mathematical programs with complementarity constraints as nonlinear programs
• Some properties of regularization and penalization schemes for MPECs
• The ESA NLP solver WORHP
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• The time-freezing reformulation for numerical optimal control of complementarity Lagrangian systems with state jumps
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

Cited in

(1)

• A neural network-based approach to hybrid systems identification for control

This page was built for publication: Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952466)