How to solve a semi-infinite optimization problem
From MaRDI portal
Publication:2253347
Recommendations
- scientific article; zbMATH DE number 4114365
- Semi-infinite optimization problems and their approximations
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- scientific article; zbMATH DE number 6790565
- Complexity aspects of a semi-infinite optimization problem†
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Approximate optimality in semi infinite programming
- The alternance method in semi-infinite optimisation problems
- scientific article; zbMATH DE number 3932798
- A finite algorithm for solving infinite dimensional optimization problems
Cites work
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- A nonsmooth version of Newton's method
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- A semi-infinite approach to design centering
- A smoothing method for mathematical programs with equilibrium constraints
- An exact sequence in differential topology
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
- Application of general semi-infinite programming to lapidary cutting problems
- Augmented lagrangians in semi-infinite programming
- Bi-level strategies in semi-infinite programming.
- Cascading: An adjusted exchange method for robust conic programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing a global optimal solution to a design centering problem
- Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
- Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Deterministic global optimization. Theory, methods and applications
- Feasible method for generalized semi-infinite programming
- First order optimality conditions for generalized semi-infinite programming problems
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation.
- First-order optimality conditions in generalized semi-infinite programming
- Foundations of bilevel programming
- General semi-infinite programming: critical point theory
- General semi-infinite programming: symmetric Mangasarian-Fromovitz constraint qualification and the closure of the feasible set
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: a tutorial
- Generalized semi-infinite programming: numerical aspects
- Generalized semi-infinite programming: On generic local minimizers
- Generalized semi-infinite programming: the nonsmooth symmetric reduction ansatz
- Generalized semi-infinite programming: The symmetric reduction ansatz
- Generalized semi-infinite programming: Theory and methods
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global solution of semi-infinite programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3896692 (Why is no real title available?)
- scientific article; zbMATH DE number 3989101 (Why is no real title available?)
- scientific article; zbMATH DE number 4034495 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 1186925 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 16989 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 3593326 (Why is no real title available?)
- scientific article; zbMATH DE number 1047616 (Why is no real title available?)
- scientific article; zbMATH DE number 1994002 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1534292 (Why is no real title available?)
- scientific article; zbMATH DE number 1845876 (Why is no real title available?)
- scientific article; zbMATH DE number 2119538 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- Interval methods for semi-infinite programs
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Lifting mathematical programs with complementarity constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- Nonsmooth semi-infinite programming problems with mixed constraints
- On constraint qualifications in nonsmooth optimization.
- On generalized semi-infinite optimization and bilevel optimization
- On generalized semi-infinite optimization of genetic networks
- On Generic One-Parametric Semi-Infinite Optimization
- On level sets of marginal functions
- On optimality conditions for generalized semi-infinite programming problems
- On Stable Feasible Sets in Generalized Semi-infinite Programming
- On the closure of the feasible set in generalized semi-infinite programming
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Optimality conditions for non-smooth semi-infinite programming
- Optimization. Algorithms and consistent approximations
- Practical bilevel optimization. Algorithms and applications
- Recent contributions to linear semi-infinite optimization
- Relaxation-Based Bounds for Semi-Infinite Programs
- Robust asset allocation
- Robust convex optimization
- Robust solutions of uncertain linear programs
- Second-order optimality conditions in generalized semi-infinite programming
- Semi-infinite optimization: Structure and stability of the feasible set
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Programming
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Semismooth Newton methods for solving semi-infinite programming problems
- Set containment characterization
- SIP: critical value functions have finite modulus of non-convexity
- Smoothing by mollifiers. I: Semi-infinite optimization
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- 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 semismooth approach for semi-infinite programming under the reduction ansatz
- The semismooth approach for semi-infinite programming without strict complementarity
- Theory and applications of robust optimization
- Variational Analysis
Cited in
(51)- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Optimization approaches to supervised classification
- Stochastic algorithm for solving convex semi-infinite programming problems with equality and inequality constraints
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Global solution of semi-infinite programs with existence constraints
- Tractable model discrimination for safety-critical systems with disjunctive and coupled constraints
- A projection approach to monotonic regression with Bernstein polynomials
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Detecting and solving aircraft conflicts using bilevel programming
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- On smoothness properties of optimal value functions at the boundary of their domain under complete convexity
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Backward-forward reachable set splitting for state-constrained differential games
- A general framework for robust topology optimization under load-uncertainty including stress constraints
- Robust nonlinear optimization with conic representable uncertainty set
- How to solve a design centering problem
- Solving air traffic conflict problems via local continuous optimization
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Lower level duality and the global solution of generalized semi-infinite programs
- Optimization with multivariate stochastic dominance constraints
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
- Feasible method for semi-infinite programs
- A new and flexible approach to the analysis of paired comparison data
- Solving generalized semi-infinite programs by reduction to simpler problems
- Solving semi-infinite programs by smoothing projected gradient method
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
- Optimality conditions for nonlinear infinite programming problems
- Semi-infinite optimization problems and their approximations
- Interactions between bilevel optimization and Nash games
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Structure-preserving function approximation via convex optimization
- Model order reduction techniques with a posteriori error control for nonlinear robust optimization governed by partial differential equations
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
- A stochastic approximation method for convex programming with many semidefinite constraints
- Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems
- Peer group situations and games with fuzzy uncertainty
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
- On the convergence of efficient solutions to semi-infinite set-optimization problems
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Convex semi-infinite programming algorithms with inexact separation oracles
- Robust energy system design via semi-infinite programming
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
This page was built for publication: How to solve a semi-infinite optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253347)
