Modified dual scheme for finite-dimensional and infinite-dimensional convex optimization problems

zbMATH Open1390.90431MaRDI QIDQ4571817FDOQ4571817

Authors:

Publication date: 29 June 2018

Full work available at URL: http://mathnet.ru/eng/dvmg350

Recommendations

• A comparison of alternative c-conjugate dual problems in infinite convex optimization
• A dual regularized method in convex finite-dimensional optimization problems
• Convex optimization in infinite dimensional spaces
• The Lagrange multiplier method in the finite convex programming problem
• Duality and infinite dimensional optimization

zbMATH Keywords

convex optimizationvariational inequalitySignorini problemLagrange functionaldual functionalsensitivity functional

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Numerical methods for variational inequalities and related problems (65K15) Optimization of other properties in solid mechanics (74P10)

Cites Work

• Title not available (Why is that?)
• The Lagrange multiplier method in the finite convex programming problem
• Sensitivity functionals in convex optimization problem
• Sensitivity functionals in variational inequalities of mechanics and their applications to duality schemes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Modified Lagrange functional for solving elastic problem with a crack in continuum mechanics

This page was built for publication: Modified dual scheme for finite-dimensional and infinite-dimensional convex optimization problems

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