scientific article; zbMATH DE number 3257595

zbMATH Open0161.07002MaRDI QIDQ5545684FDOQ5545684

Authors: E. S. Levitin, Boris T. Polyak 

Publication date: 1966

Title of this publication is not available (Why is that?)

zbMATH Keywords

ordinary differential equations

Cited In (only showing first 100 items - show all)

• Investigation of the total error in minimization of functionals with constraints
• Convex constrained optimization for large-scale generalized Sylvester equations
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Well-posedness of the split inverse variational inequality problem
• On iterative algorithms for linear least squares problems with bound constraints
• Well-posedness of generalized vector quasivariational inequality problems
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Levitin-Polyak well-posedness for parametric quasivariational inequality problem of the Minty type
• Modified self-adaptive projection method for solving pseudomonotone variational inequalities
• Well-posedness for convex symmetric vector quasi-equilibrium problems
• A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
• Levitin-Polyak well-posedness by perturbations of inverse variational inequalities
• Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
• Convex quadratic programming with one constraint and bounded variables
• \(\alpha\)-well-posedness for mixed quasi variational-like inequality problems
• Levitin–Polyak Well-Posedness of Strong Parametric Vector Quasi-equilibrium Problems
• Inexact proximal point method for general variational inequalities
• Levitin-Polyak well-posedness in generalized vector variational inequality problem with functional constraints
• Well-set and well-posed minimization problems
• Levitin-polyak well-posedness of vector equilibrium problems
• Well-posedness without semicontinuity for parametric quasiequilibria and quasioptimization
• Levitin-Polyak well-posedness of constrained vector optimization problems
• Several types of well-posedness for generalized vector quasi-equilibrium problems with their relations
• Well-posedness for parametric strong vector quasi-equilibrium problems with applications
• Hadamard well-posedness of a general mixed variational inequality in Banach space
• \(\alpha\)-well-posedness for quasivariational inequality problems
• Levitin-Polyak well-posedness of generalized vector quasi-equilibrium problems with functional constraints
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• Error bounds in mathematical programming
• Levitin-Polyak well-posedness of variational inequalities
• On the convergence of a numerical method for optimal control problems
• The generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems
• The well-posedness for multiobjective generalized games
• Hilbertian convex feasibility problem: Convergence of projection methods
• Well-posedness for systems of time-dependent hemivariational inequalities in Banach spaces
• Existence and well-posedness for symmetric vector quasi-equilibrium problems
• Strong convergence of a projected gradient method
• The Levitin-Polyak well-posedness by perturbations for systems of general variational inclusion and disclusion problems
• Levitin-Polyak well-posedness of variational inequality problems with functional constraints
• Well-posedness by perturbations for variational-hemivariational inequalities
• Levitin-Polyak well-posedness of a generalized mixed variational inequality in Banach spaces
• Levitin-Polyak well-posedness of generalized quasivariational inequalities with functional constraints
• The weight-decay technique in learning from data: an optimization point of view
• A modified projection method for solving co-coercive variational inequalities
• Some Goldstein's type methods for co-coercive variant variational inequalities
• Solution of projection problems over polytopes
• Extended well-posedness of quasiconvex vector optimization problems
• A self-adaptive projection method with improved step-size for solving variational inequalities
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
• Levitin-Polyak well-posedness in vector quasivariational inequality problems with functional constraints
• Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
• On the well-posedness of variational-hemivariational inequalities and associated fixed point problems
• A two-stage prediction-correction method for solving monotone variational inequalities
• Levitin-Polyak well-posedness by perturbations for systems of set-valued vector quasi-equilibrium problems
• Well-posedness for generalized quasi-variational inclusion problems and for optimization problems with constraints
• Self-adaptive projection method for co-coercive variational inequalities
• Title not available (Why is that?)
• Learning with generalization capability by kernel methods of bounded complexity
• Projected gradient methods for linearly constrained problems
• On finite convergence and constraint identification of subgradient projection methods
• Title not available (Why is that?)
• Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
• Linear convergence of iterative soft-thresholding
• Levitin-Polyak well-posedness by perturbations for the split inverse variational inequality problem
• On the stability and Levitin-Polyak well-posedness of parametric multiobjective generalized games
• Some recent advances in projection-type methods for variational inequalities
• An improved Goldstein's type method for a class of variant variational inequalities
• Monotone projected gradient methods for large-scale box-constrained quadratic programming
• Nonlinear programming methods in the presence of noise
• New extragradient-type methods for solving variational inequalities
• A modified projection method with a new direction for solving variational inequalities
• Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
• Well-posed constrained optimization problems in metric spaces
• Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems
• LP well-posed controlled systems for bounded quasi-equilibrium problems and their application to traffic networks
• Über eine Penalty-Methode
• Global convergence of a modified gradient projection method for convex constrained problems
• Levitin-Polyak well-posedness of an equilibrium-like problem in Banach spaces
• Generalized well-posedness for parametric fuzzy generalized multiobjective games
• Levitin-Polyak well-posedness for bilevel vector variational inequalities
• A cyclic projected gradient method
• Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
• Levitin-Polyak well-posedness for strong bilevel vector equilibrium problems and applications to traffic network problems with equilibrium constraints
• LP well-posedness for bilevel vector equilibrium and optimization problems with equilibrium constraints
• An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach
• A New Topological Framework and Its Application to Well-Posedness in Set-Valued Optimization
• Levitin-Polyak well-posedness for split equilibrium problems
• Levitin-Polyak well-posedness for vector optimization problems in linear spaces
• Uniformly convex and uniformly smooth convex functions
• Well-posedness for bilevel vector equilibrium problems with variable domination structures
• Existence and well-posedness for excess demand equilibrium problems
• Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods
• Convex approximation of a controlled process and a method of synthesizing generalized optimal regimes
• A convergence criterion for elliptic variational inequalities
• Bounded controlling sequences, lower stability and certain penalty procedures
• On Well-Posedness for Perturbed Quasi-Equilibrium and Quasi-Optimization Problems
• An algorithm for the minimization of convex non differentiable functionals in Hilbert space
• Levitin-Polyak well-posedness of a system of generalized vector variational inequality problems
• Levitin-Polyak well-posedness for set optimization problems involving set order relations

This page was built for publication:

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