A new duality theory for mathematical programming

DOI10.1080/02331934.2010.524217MaRDI QIDQ3112511zbMATH OpenOpenAlexFDO

Authors B. F. Svaiter

Publication date 10 January 2012

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2010.524217

zbMATH Keywords

abstract dualityabstract KKT conditions involutiongeneralized conjugationLagrangian function

Mathematics Subject Classification ID

Optimality conditions for problems in abstract spaces (49K27) Duality theory (optimization) (49N15) Programming in abstract spaces (90C48)

Recommendations

• Theory of Duality in Mathematical Programming
• Introduction to duality in optimization theory
• scientific article; zbMATH DE number 1399496
• scientific article; zbMATH DE number 96516
• scientific article; zbMATH DE number 3948007

Cites work

• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• A relaxed version of Bregman's method for convex programming
• A row-action method for convex programming
• A successive projection method
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• An Algorithm for Restricted Least Squares Regression
• An elementary survey of general duality theory in mathematical programming
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• Extensions of Lagrange Multipliers in Nonlinear Programming
• Fixed points of nonexpanding maps
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Monotone (nonlinear) operators in Hilbert space
• Monotone Operators and the Proximal Point Algorithm
• Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant
• On \Phi -Convexity in Extremal Problems
• On the convergence of the exponential multiplier method for convex programming
• Primal-dual row-action method for convex programming

Cited in

(7)

• A strongly convergent proximal point method for vector optimization
• Prices stabilization for inexact unit-commitment problems
• On duality for mathematical programs with vanishing constraints
• Strong convergence in Hilbert spaces via -duality
• Connection of two approaches to the Fisher model
• A hybrid gradient method for vector optimization problems
• Semi-continuous quadratic optimization: existence conditions and duality scheme

This page was built for publication: A new duality theory for mathematical programming

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