Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
From MaRDI portal
Cites work
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- Bi-level strategies in semi-infinite programming.
- Bilevel optimization: reformulation and first optimality conditions
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Directional derivatives of the solution of a parametric nonlinear program
- Discretization in semi-infinite programming: the rate of convergence
- Foundations of bilevel programming
- Generalized sensitivity analysis of nonlinear programs
- Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global solution of semi-infinite programs
- Gradient sampling methods for nonsmooth optimization
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3810823 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Infinitely constrained optimization problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- JuMP: a modeling language for mathematical optimization
- Lectures on convex optimization
- Mixed integer linear programming formulation techniques
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- Newton's method for convex programming and Tschebyscheff approximation
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Relaxation-Based Bounds for Semi-Infinite Programs
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Subgradients of marginal functions in parametric mathematical programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The Cutting-Plane Method for Solving Convex Programs
- The Minimization of Semicontinuous Functions: Mollifier Subgradients
This page was built for publication: Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878836)
