The following pages link to Jean-Jacques Strodiot (Q479248):
Displaying 50 items.
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- A class of hybrid methods for quasi-variational inequalities (Q479250) (← links)
- (Q589415) (redirect page) (← links)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
- Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309) (← links)
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function (Q635806) (← links)
- Random algorithms for convex minimization problems (Q644912) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- Validation analysis of mirror descent stochastic approximation method (Q715058) (← links)
- A primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Direct Newton method for a linear problem of semidefinite programming (Q735655) (← links)
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data (Q795323) (← links)
- The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
- Smoothing technique and its applications in semidefinite optimization (Q879964) (← links)
- A class of shrinking projection extragradient methods for solving non-monotone equilibrium problems in Hilbert spaces (Q905763) (← links)
- Linear and nonlinear programming. (Q935681) (← links)
- A bundle method for solving equilibrium problems (Q959957) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505) (← links)
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds (Q1014028) (← links)
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
- An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
- (Q1028591) (redirect page) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
- (Q1115353) (redirect page) (← links)
- A bracketing technique to ensure desirable convergence in univariate minimization (Q1115354) (← links)
- Some properties of a uniformly linearly independent sequence of subspaces (Q1138348) (← links)
- Computing a global optimal solution to a design centering problem (Q1184340) (← links)
- An exponential penalty method for nondifferentiable minimax problems with general constraints (Q1245152) (← links)
- On the convergence rate for a penalty function method of exponential type (Q1247371) (← links)
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators (Q1265027) (← links)
- A rapidly convergent five-point algorithm for univariate minimization (Q1321651) (← links)
- Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities (Q1573993) (← links)
- Strong convergence theorems for equilibrium problems and fixed point problems in Banach spaces (Q1615336) (← links)
- Strong convergence of an iterative method for solving the multiple-set split equality fixed point problem in a real Hilbert space (Q1674099) (← links)
- The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces (Q1702875) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- Using the Banach contraction principle to implement the proximal point method for multivalued monotone variational inequalities (Q1777587) (← links)
- On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities (Q1800449) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- Family of perturbation methods for variational inequalities (Q1918010) (← links)
- Extragradient methods and linesearch algorithms for solving Ky Fan inequalities and fixed point problems (Q1935300) (← links)
- One-dimensional identification problem and ranking parameters (Q1959238) (← links)
- Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems (Q1987449) (← links)
- Iterative regularization methods with new stepsize rules for solving variational inclusions (Q2143818) (← links)
- Convergence of a hybrid viscosity approximation method for finding zeros of \(m\)-accretive operators (Q2173345) (← links)
