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

DOI10.1287/OPRE.26.4.681zbMATH Open0391.90075OpenAlexW1969648546MaRDI QIDQ4173201FDOQ4173201

Authors: 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)

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173201)