Semi-infinite programming, duality, discretization and optimality conditions†

From MaRDI portal
Publication:3622011

DOI10.1080/02331930902730070zbMath1158.90410OpenAlexW2043136268MaRDI QIDQ3622011

Alexander Shapiro

Publication date: 23 April 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902730070




Related Items

LP relaxations for a class of linear semi-infinite programming problemsOn iteration complexity of a first-order primal-dual method for nonlinear convex cone programmingFirst and second order optimality conditions in vector optimization problems with nontransitive preference relationNo-arbitrage bounds for the forward smile given marginalsDistributionally robust portfolio optimization with linearized STARR performance measureConstraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programsA Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone ConstraintsSolving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimizationNon-convex semi-infinite min-max optimization with noncompact setsRate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problemsStationarity and regularity of infinite collections of sets: applications to infinitely constrained optimizationSecond order analysis for robust inclusion systems and applicationsFormulas of first-ordered and second-ordered generalization differentials for convex robust systems with applicationsRecent advances in nonconvex semi-infinite programming: applications and algorithmsOptimality analysis of a class of semi-infinite programming problemsVariational analysis based on proximal subdifferential on smooth Banach spacesAn SDP method for fractional semi-infinite programming problems with SOS-convex polynomialsFirst and second order optimality conditions for vector optimization problems on metric spacesStability and augmented Lagrangian duality in nonconvex semi-infinite programmingNonsmooth semi-infinite programming problem using limiting subdifferentialsUnnamed ItemTheory and Algorithms for Shapelet-Based Multiple-Instance LearningOn nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexitySolving semi-infinite programs by smoothing projected gradient methodOn an eigenvalue for the Laplace operator in a disk with Dirichlet boundary condition on a small part of the boundary in a critical caseOn solving a class of fractional semi-infinite polynomial programming problemsConvex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problemNonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexityAn improved bootstrap test for restricted stochastic dominanceStrong duality and sensitivity analysis in semi-infinite linear programmingSecond-order sequence-based necessary optimality conditions in constrained nonsmooth vector optimization and applicationsMultiobjective DC programs with infinite convex constraintsDuality for nonsmooth semi-infinite programming problemsHow to solve a semi-infinite optimization problemRelaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problemsThe Alternating Descent Conditional Gradient Method for Sparse Inverse ProblemsOn necessary optimality conditions for nonsmooth vector optimization problems with mixed constraints in infinite dimensionsLagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraintsDistributionally robust optimization. A review on theory and applicationsOn \(\epsilon\)-solutions for robust semi-infinite optimization problemsDuality models for multiobjective semiinfinite fractional programming problems involving type-I and related functionsProjection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex ProgrammingDistributionally robust inference for extreme value-at-riskAn inexact primal-dual algorithm for semi-infinite programmingUnnamed ItemUnnamed ItemOptimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexitySlater Condition for Tangent Derivatives



Cites Work