Continuous algorithms for solution of convex optimization problems and finding saddle points of contex-coneave functions with the use of projection operations

DOI10.1080/02331938508843045zbMath0592.90073OpenAlexW2121738381MaRDI QIDQ3722276

V. I. Venets

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

maximal monotone operatorsdirect Lyapunov methodcontinuous algorithmsconvex-concave functionsconvex conditional optimizationsearch for saddle points

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items

Semi-global exponential stability of augmented primal-dual gradient dynamics for constrained convex optimization ⋮ Solving cone-constrained convex programs by differential inclusions ⋮ Paths to constrained Nash equilibria ⋮ Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems ⋮ Stability and robustness for saddle-point dynamics through monotone mappings ⋮ Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games ⋮ On finite convergence and constraint identification of subgradient projection methods

Cites Work

• A geometric method in nonlinear programming
• Nonlinear semigroups in Hilbert space
• Convex Analysis