Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis.

DOI10.1007/BF03398705zbMath1151.90519OpenAlexW2772524186MaRDI QIDQ2477109

Hossein Arsham

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398705

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Related Items (1)

Construction of the largest sensitivity region for general linear programs

Uses Software

• Global Optimization Toolbox For Maple
• LGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained global optimization: algorithms and applications
• Checking local optimality in constrained quadratic programming is NP- hard
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A practical anti-cycling procedure for linearly constrained optimization
• Affine geometric method for linear programs
• Primal-dual methods for vertex and facet enumeration
• Proximal quasi-Newton methods for nondifferentiable convex optimization
• Enumerating extreme points of a highly degenerate polytope
• Combinatorial face enumeration in convex polytopes
• How good are convex hull algorithms?
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• An algorithm for global minimization of linearly constrained quadratic functions
• Perturbation analysis of general LP models: A unified approach to sensitivity, parametric, tolerance, and more-for-less analysis
• New LP bound in multivariate Lipschitz optimization: Theory and applications
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• A variable target value method for nondifferentiable optimization
• Tolerance approach to sensitivity analysis in quadratic programming problems.
• A linear fractional program with homogeneous constraints.
• On fractional programming.
• Multiparametric analysis of the maximum tolerance in quadratic programming problems.
• Programming with the sum of a linear and quotient objective function.
• Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
• Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
• A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty

This page was built for publication: Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis.