Mohammad S. Alkousa

From MaRDI portal
Person:1982925

Available identifiers

zbMath Open alkousa.mohammad-sMaRDI QIDQ1982925

List of research outcomes





PublicationDate of PublicationType
Optimization in complex spaces with the mixed Newton method2024-10-14Paper
Adaptive subgradient methods for mathematical programming problems with quasiconvex functions2024-02-16Paper
Subgradient methods with variants of Polyak step-size for quasi-convex optimization with inequality constraints for analogues of sharp minima2023-12-12Paper
https://portal.mardi4nfdi.de/entity/Q60836432023-12-08Paper
Gradient-Type Methods for Optimization Problems with Polyak-Łojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter2023-11-17Paper
Solving strongly convex-concave composite saddle-point problems with low dimension of one group of variable2023-10-04Paper
Intermediate Gradient Methods with Relative Inexactness2023-09-30Paper
Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness2023-08-10Paper
Adaptive Methods or Variational Inequalities with Relatively Smooth and Reletively Strongly Monotone Operators2023-08-01Paper
Adaptive Variant of the Frank-Wolfe Algorithm for Convex Optimization Problems2023-07-29Paper
Online Optimization Problems with Functional Constraints under Relative Lipschitz Continuity and Relative Strong Convexity Conditions2023-03-05Paper
Numerical methods for some classes of variational inequalities with relatively strongly monotone operators2023-01-04Paper
Subgradient methods for non-smooth optimization problems with some relaxation of sharp minimum2022-12-12Paper
Gradient-Type Methods For Decentralized Optimization Problems With Polyak-{\L}ojasiewicz Condition Over Time-Varying Networks2022-10-07Paper
Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle2022-08-01Paper
Optimization in complex spaces with the Mixed Newton Method2022-07-09Paper
Inexact model: a framework for optimization and variational inequalities2022-06-13Paper
An Approach for Non-Convex Uniformly Concave Structured Saddle Point Problem2022-02-13Paper
Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other2022-01-21Paper
On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints2021-11-22Paper
New version of mirror prox for variational inequalities with adaptation to inexactness2021-09-14Paper
Some Methods for Relatively Strongly Monotone Variational Inequalities2021-09-07Paper
Mirror descent and constrained online optimization problems2021-05-18Paper
Algorithms for solving variational inequalities and saddle point problems with some generalizations of Lipschitz property for operators2021-03-01Paper
Solving smooth min-min and min-max problems by mixed oracle algorithms2021-02-28Paper
Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems2021-02-25Paper
Accelerated methods for saddle-point problem2020-12-10Paper
Solving strongly convex-concave composite saddle point problems with a small dimension of one of the variables2020-10-05Paper
On some methods for strongly convex optimization problems with one functional constraint2020-05-19Paper
Inexact Relative Smoothness and Strong Convexity for Optimization and Variational Inequalities by Inexact Model2020-01-23Paper
Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints2019-12-02Paper
Accelerated methods for composite non-bilinear saddle point problem2019-06-09Paper
On Some Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints2018-12-18Paper
Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle2018-06-13Paper
Adaptive algorithms for mirror descent in convex programming problems with Lipschitz constraints2018-05-27Paper
Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes RulesN/APaper

Research outcomes over time

This page was built for person: Mohammad S. Alkousa