MM algorithms for geometric and signomial programming

DOI10.1007/s10107-012-0612-1zbMath1286.90110arXiv1007.2371OpenAlexW3105330742WikidataQ38257047 ScholiaQ38257047MaRDI QIDQ2436647

Hua Zhou, Kenneth L. Lange

Publication date: 25 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.2371

zbMATH Keywords

global convergencearithmetic-geometric mean inequalitygeometric programmingpenalty methodMM algorithmparameter separationsignomial programminglinearly constrained quadratic programming

Mathematics Subject Classification ID

Convex programming (90C25) Inequalities involving other types of functions (26D07)

Related Items

Maximum likelihood estimation for incomplete multinomial data via the weaver algorithm ⋮ Global optimization of signomial geometric programming problems ⋮ A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ Path following in the exact penalty method of convex programming ⋮ MM Algorithms for Variance Components Models ⋮ Another Look at Distance-Weighted Discrimination ⋮ Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast procedure for calculating importance weights in bootstrap sampling
• Path following in the exact penalty method of convex programming
• A quasi-Newton acceleration for high-dimensional optimization algorithms
• Graphics processing units and high-dimensional optimization
• A tutorial on geometric programming
• The geometric programming dual to the extinction probability problem in simple branching processes
• Convex analysis and nonlinear optimization. Theory and examples
• A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
• Geometric Programming: Methods, Computations and Applications
• Maximum likelihood estimates for multinomial probabilities via geometric programming
• Geometric Programming
• Numerical Optimization