Feasible method for semi-infinite programs
From MaRDI portal
Publication:3461986
Recommendations
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- scientific article; zbMATH DE number 3936944
- Feasible method for generalized semi-infinite programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- scientific article; zbMATH DE number 6386
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3810823 (Why is no real title available?)
- scientific article; zbMATH DE number 1186920 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- A cutting-plane method for quadratic semi infinite programming problems
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A new exchange method for convex semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- An iterative method for solving KKT system of the semi-infinite programming
- Approximation to Optimization Problems: An Elementary Review
- Bi-level strategies in semi-infinite programming.
- Computational discretization algorithms for functional inequality constrained optimization
- Convex Analysis
- Feasible method for generalized semi-infinite programming
- 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
- How to solve a semi-infinite optimization problem
- Interval Slopes for Rational Functions and Associated Centered Forms
- Interval analysis: Theory and applications
- Interval methods for semi-infinite programs
- Lipschitzian optimization without the Lipschitz constant
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Optimal control of nonlinear switched systems: computational methods and applications
- Relaxation-Based Bounds for Semi-Infinite Programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite optimization: Structure and stability of the feasible set
- Semi-infinite programming
- Set-valued analysis
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- The design of FIR filters in the complex plane by convex optimization
- Theory and applications of robust optimization
Cited in
(18)- scientific article; zbMATH DE number 4001882 (Why is no real title available?)
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- scientific article; zbMATH DE number 1275849 (Why is no real title available?)
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- Feasible method for generalized semi-infinite programming
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- On the convergence of efficient solutions to semi-infinite set-optimization problems
- Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- Distributionally robust optimization. A review on theory and applications
- Interval methods for semi-infinite programs
- Optimality analysis of a class of semi-infinite programming problems
- Frameworks and results in distributionally robust optimization
- An interior semi-infinite programming method
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
This page was built for publication: Feasible method for semi-infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461986)
