A new duality theory for mathematical programming
From MaRDI portal
Publication:3112511
DOI10.1080/02331934.2010.524217zbMath1242.49074MaRDI QIDQ3112511
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
90C48: Programming in abstract spaces
49N15: Duality theory (optimization)
49K27: Optimality conditions for problems in abstract spaces
Related Items
On duality for mathematical programs with vanishing constraints, Strong convergence in Hilbert spaces via \(\varGamma \)-duality, Semi-continuous quadratic optimization: existence conditions and duality scheme, A strongly convergent proximal point method for vector optimization
Cites Work
- On the convergence of the exponential multiplier method for convex programming
- A relaxed version of Bregman's method for convex programming
- Monotone (nonlinear) operators in Hilbert space
- A successive projection method
- A row-action method for convex programming
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Primal-dual row-action method for convex programming
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An Algorithm for Restricted Least Squares Regression
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- An elementary survey of general duality theory in mathematical programming
- Monotone Operators and the Proximal Point Algorithm
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- On $\Phi $-Convexity in Extremal Problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant
- Fixed points of nonexpanding maps
- Extensions of Lagrange Multipliers in Nonlinear Programming
