Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs

DOI10.1287/opre.26.4.681zbMath0391.90075OpenAlexW1969648546MaRDI QIDQ4173201

Barry Randall Marks, Gordon P. Wright

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.4.681

zbMATH Keywords

Inner Approximation AlgorithmsNonconvex Mathematical Programs

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (12)

Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ Global optimization of signomial geometric programming problems ⋮ Nonparametric mean-lower partial moment model and enhanced index investment ⋮ Global optimization for optimal power flow over transmission networks ⋮ Sensor selection for remote state estimation with QoS requirement constraints ⋮ Utility maximization for bandwidth allocation in peer-to-peer file-sharing networks ⋮ Multi-path utility maximization and multi-path TCP design ⋮ Largest small polygons: a sequential convex optimization approach ⋮ mReno: a practical multipath congestion control for communication networks ⋮ Inner approximation algorithm for generalized linear multiplicative programming problems ⋮ Sequential parametric convex approximation algorithm for bilinear matrix inequality problem ⋮ Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming

This page was built for publication: Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs