Infinitely constrained optimization problems
From MaRDI portal
Publication:1218343
DOI10.1007/BF00934096zbMath0307.90071OpenAlexW2076321036MaRDI QIDQ1218343
J. W. Blankenship, James E. Falk
Publication date: 1976
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934096
Convex programming (90C25) Nonlinear programming (90C30) 2-person games (91A05) Existence of solutions for minimax problems (49J35)
Related Items (63)
Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Multiple objective programming problems with possibilistic coefficients ⋮ A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ Towards global bilevel dynamic optimization ⋮ Towards rigorous robust optimal control via generalized high-order moment expansion ⋮ Multilevel flow control in telecommunication networks ⋮ A branch and bound algorithm for quantified quadratic programming ⋮ Network design problem with congestion effects: A case of bilevel programming ⋮ An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ Robust international portfolio management ⋮ Fuzzy optimization: An appraisal ⋮ A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Bilevel Polynomial Programs and Semidefinite Relaxation Methods ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ \(K\)-adaptability in two-stage mixed-integer robust optimization ⋮ A cutting-plane algorithm with linear and geometric rates of convergence ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ Local optimization of dynamic programs with guaranteed satisfaction of path constraints ⋮ A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming ⋮ A new solution to optimization-satisfaction problems by a penalty method ⋮ Computer-aided design via optimization: A review ⋮ A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ Optimal deviations from an asset allocation. ⋮ Generalized Farkas' theorem and optimization of infinitely constrained problems ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ Necessity measure optimization in linear programming problems with fuzzy polytopes ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ Almost robust discrete optimization ⋮ Implicitly defined optimization problems ⋮ A cutting-plane method for quadratic semi infinite programming problems ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ A parallel algorithm for semi-infinite programming ⋮ Min-max-min robust combinatorial optimization ⋮ Outer approximation schemes for generalized semi-infinite variational inequality problems ⋮ A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination ⋮ Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints ⋮ Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems ⋮ Production and marketing decisions with multiple objectives in a competitive environment ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Global solution of semi-infinite programs with existence constraints ⋮ An outer approximations algorithm for computer-aided design problems ⋮ Multistage Adaptive Robust Optimization for the Unit Commitment Problem ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Global solution of bilevel programs with a nonconvex inner program ⋮ Robust Quadratic Programming with Mixed-Integer Uncertainty ⋮ A direct method of linearization for continuous minimax problems ⋮ An algorithm for the global optimization of a class of continuous minimax problems ⋮ Global optimization of semi-infinite programs via restriction of the right-hand side ⋮ A method of centers algorithm for certain minimax problems ⋮ Inexact linear programming with generalized technological matrix sets ⋮ A dual parameterization approach to linear-quadratic semi-infinite programming problems ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Allocation of resources to offensive strategic weapon systems
- Applications of a general convergence theory for outer approximation algorithms
- Numerical treatment of a class of semi‐infinite programming problems
- Cutting-Plane Methods without Nested Constraint Sets
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
- Mathematical Programs with Optimization Problems in the Constraints
This page was built for publication: Infinitely constrained optimization problems
