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

DOI10.1287/OPRE.26.4.681MaRDI QIDQ4173201zbMATHOpenAlexFDO

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)

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

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)