The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
From MaRDI portal
Recommendations
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Feasible method for semi-infinite programs
- scientific article; zbMATH DE number 3936944
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Feasible method for generalized semi-infinite programming
Cites work
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Bi-level strategies in semi-infinite programming.
- Computing a global optimal solution to a design centering problem
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Error bounds in mathematical programming
- Global solution of bilevel programs with a nonconvex inner program
- Global solution of semi-infinite programs
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 16989 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- Interval methods for semi-infinite programs
- Interval Methods for Systems of Equations
- Lifting mathematical programs with complementarity constraints
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- On generalized semi-infinite optimization and bilevel optimization
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Optimization. Algorithms and consistent approximations
- Relaxation-Based Bounds for Semi-Infinite Programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
Cited in
(25)- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Convexification method for bilevel programs with a nonconvex Follower's problem
- Global solution of semi-infinite programs with existence constraints
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- On solving a class of fractional semi-infinite polynomial programming problems
- How to solve a semi-infinite optimization problem
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
- Dynamic optimization of state-dependent switched systems with free switching sequences
- Feasible method for semi-infinite programs
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- MPEC methods for bilevel optimization problems
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- scientific article; zbMATH DE number 227711 (Why is no real title available?)
- A survey of nonlinear robust optimization
- Feasible method for generalized semi-infinite programming
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
This page was built for publication: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925776)
