A Variable-Complexity Norm Maximization Problem

DOI10.1137/0607052zbMath0589.68033OpenAlexW2012423427MaRDI QIDQ3718152

Tzong-Huei Shiau, Olvi L. Mangasarian

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/58574

zbMATH Keywords

NP-completenesspolynomial timemaximum normbounded polyhedral set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Linear programming (90C05)

Related Items

Automatic robust convex programming, Distributionally robust mixed integer linear programs: persistency models with applications, On the complexity of some basic problems in computational convexity. I. Containment problems, Optimal Information Blending with Measurements in the L² Sphere, The design centering problem as a d.c. programming problem, Distributionally Robust Linear and Discrete Optimization with Marginals, Data-driven distributionally robust risk-averse two-stage stochastic linear programming over Wasserstein ball, Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results, Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit, Robust two-stage stochastic linear optimization with risk aversion, Computational complexity of norm-maximization, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Hoffman's least error bounds for systems of linear inequalities, Computing the covering radius of a polytope with an application to lonely runners, Fixed-parameter complexity and approximability of norm maximization, Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs, On the entropy of couplings, Global optimization algorithms for linearly constrained indefinite quadratic problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple characterization of solutions sets of convex programs
• Complementary pivot theory of mathematical programming
• Boundedness relations for linear constraint sets
• Khachiyan’s algorithm for linear programming
• Characterizations of bounded solutions of linear complementarity problems
• A Characterization of Stability in Linear Programming
• Convex Analysis
• Complementarity Theorems for Linear Programming
• Marginal Values in Linear Programming