Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem

DOI10.1134/S199047891801009XzbMATH Open1413.90262OpenAlexW2791908332WikidataQ130150826 ScholiaQ130150826MaRDI QIDQ4553644FDOQ4553644

Authors: Aleksandr Yu. Krylatov 

Publication date: 30 October 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199047891801009x

Recommendations

• Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
• Convex separable minimization problems with a linear constraint and bounded variables
• scientific article; zbMATH DE number 5270560
• Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
• Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
• Minimizing Separable Convex Functions Subject to Simple Chain Constraints
• Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
• Convex separable minimization subject to bounded variables
• On the minimization problem of sub-linear convex functionals
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints

zbMATH Keywords

fixed point problemconstrained nonlinear optimizationnetwork flow assignmentgeneralized projection matrix

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonlinear programming (90C30)

Cites Work

• A unified description of iterative algorithms for traffic equilibria
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel optimization for traffic assignment
• Network flow assignment as a fixed point problem

Cited In (4)

• A computational approach to estimating activity coefficients using Gibbs energy minimization
• Column generation for the equilibrium route-flow traffic assignment problem
• On reduction of some multifold minimax problems with coupled constraints
• Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network

This page was built for publication: Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem

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