Optimal deterministic algorithm generation

DOI10.1007/s10898-018-0611-8zbMath1405.90086arXiv1609.06917OpenAlexW2526782669MaRDI QIDQ1668803

Jaromił Najman, Ioannis G. Kevrekidis, Alexander Mitsos

Publication date: 29 August 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.06917

zbMATH Keywords

optimizationalgorithmsoptimal controlnonlinear equations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items (2)

Personalized Algorithm Generation: A Case Study in Learning ODE Integrators ⋮ A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms

Uses Software

• KNITRO
• NewtonLib
• GAMS
• libMC
• Algorithm 966

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimized first-order methods for smooth convex minimization
• Convergence rate of McCormick relaxations
• Global solution of bilevel programs with a nonconvex inner program
• Direct methods with maximal lower bound for mixed-integer optimal control problems
• The cluster problem in multivariate global optimization
• A polyhedral branch-and-cut approach to global optimization
• Rigorous convex underestimators for general twice-differentiable problems
• Performance of first-order methods for smooth convex minimization: a novel approach
• Multivariate McCormick relaxations
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Convex and concave relaxations of implicit functions
• Global optimization of semi-infinite programs via restriction of the right-hand side
• Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
• McCormick-Based Relaxations of Algorithms
• The Convergence of the Ben-Israel Iteration for Nonlinear Least Squares Problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A nonconvex max-min problem
• Introduction to Stochastic Programming
• High-Order Strong-Stability-Preserving Runge--Kutta Methods with Downwind-Biased Spatial Discretizations
• Nonlinear Programming
• Algorithm 966
• The Solution of Nonlinear Systems of Equations by A-Stable Integration Techniques
• Global optimization of explicit strong-stability-preserving Runge-Kutta methods

This page was built for publication: Optimal deterministic algorithm generation