General convex relaxations of implicit functions and inverse functions

DOI10.1007/s10898-023-01281-0zbMath1530.90081MaRDI QIDQ6173953

Kamil A. Khan, Huiyi Cao

Publication date: 13 July 2023

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

zbMATH Keywords

nonconvex optimizationconstraint satisfaction problemsconvex underestimatorsMcCormick relaxationsimplicit functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved relaxations for the parametric solutions of ODEs using differential inequalities
• Reverse propagation of McCormick relaxations
• Differentiable McCormick relaxations
• Three enhancements for optimization-based bound tightening
• Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
• An interval Newton method
• Convergence rate of McCormick relaxations
• Generalized McCormick relaxations
• Lectures on convex optimization
• Convexity and concavity properties of the optimal value function in parametric nonlinear programming
• Bounding solutions of systems of equations using interval analysis
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Corrections to: ``Differentiable McCormick relaxations
• Directional derivatives of the solution of a parametric nonlinear program
• Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Multivariate McCormick relaxations
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Introduction to Piecewise Differentiable Equations
• Adjoint Mode Computation of Subgradients for McCormick Relaxations
• Convex and concave relaxations of implicit functions
• Julia: A Fresh Approach to Numerical Computing
• Evaluating Derivatives
• McCormick-Based Relaxations of Algorithms
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• CONOPT—A Large-Scale GRG Code
• Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
• Iterative Solution of Nonlinear Equations in Several Variables
• EAGO.jl: easy advanced global optimization in Julia
• Implicit Functions and Solution Mappings
• JuMP: A Modeling Language for Mathematical Optimization
• Ordinary Differential Equations