Epigraphical nesting: A unifying theory for the convergence of algorithms

DOI10.1007/BF02192118zbMath0823.90115OpenAlexW2065121977MaRDI QIDQ1893312

Suvrajeet Sen, Julia L. Higle

Publication date: 3 July 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192118

zbMATH Keywords

variational inequalitiesNewton methoddirectional derivativesnon-smooth optimizationconvergence of global optimization algorithmsepigraphical nesting of objective functions

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Comparison theorems for algorithmic models, Consistent approximations in composite optimization, An SQP-type method and its application in stochastic programs, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification

Cites Work

• Unnamed Item
• Unnamed Item
• Block truncated-Newton methods for parallel optimization
• A tolerant algorithm for linearly constrained optimization calculations
• Partitioning procedures for solving mixed-variables programming problems
• Finite master programs in regularized stochastic decomposition
• The Cutting-Plane Method for Solving Convex Programs
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Descent methods for composite nondifferentiable optimization problems
• A regularized decomposition method for minimizing a sum of polyhedral functions
• Inexact Newton Methods
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming