Shooting method for solving equilibrium programming problems

DOI10.1134/S0965542513120038zbMATH Open1313.90177MaRDI QIDQ2940338FDOQ2940338

B. A. Budak

Publication date: 26 January 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

weak convergencestrong convergenceshooting methodequilibrium programmingskew-symmetry conditioninvertible strong monotonocity of the gradient

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equilibrium programming: Proximal methods
• Equilibrium programming: Gradient methods
• Calculation of fixed points of extremal mappings by gradient-type methods
• Existence and uniqueness of solution of problem of balanced programming

Cited In (3)

• Solving BVPs with shooting method and VIMHP
• Modifying the shooting model for solving equilibrium problems
• Variational approach to finding the cost-optimal trajectory;Вариационный подход к поиску оптимальной по стоимости траектории

This page was built for publication: Shooting method for solving equilibrium programming problems

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