Parametric network utility maximization problem

DOI10.1007/S11590-013-0639-0MaRDI QIDQ2448168zbMATH OpenOpenAlexFDO

Authors Lutbat Yadamsuren, Suk-Hwan Lee, Won-Joo Hwang, R. Enkhbat

Publication date 30 April 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-013-0639-0

zbMATH Keywords

Lipschitz functionutility maximizationparametric optimizationpathfollowing method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Parametric optimization approach to utility maximization problem
• The maximum parametric flow in discrete-time dynamic networks
• Parametric flows in static networks
• A parametric problem of optimal stochastic control
• Continuity and monotonicity of solutions to a greedy maximization problem

Cites work

• scientific article; zbMATH DE number 5355264 (Why is no real title available?)
• scientific article; zbMATH DE number 48687 (Why is no real title available?)
• scientific article; zbMATH DE number 1568265 (Why is no real title available?)
• A quadratically-convergent algorithm for general nonlinear programming problems
• Adaptive OFDM synchronization algorithms based on discrete stochastic approximation
• Adaptive stepsize selection for tracking in a regime-switching environment
• Fundamentals of Wireless Communication
• On the numerical feasibility of continuation methods for nonlinear programming problems
• Strongly Regular Generalized Equations

Cited in

(3)

• Continuity and monotonicity of solutions to a greedy maximization problem
• Parametric optimization approach to utility maximization problem
• Necessary and sufficient condition for non-concave network utility maximisation

This page was built for publication: Parametric network utility maximization problem

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