The following pages link to (Q4273942):
Displaying 50 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Strong convergence results of two-steps modifying Halpern's iteration for Bregman strongly nonexpansive multi-valued mappings in reflexive Banach spaces with application (Q257806) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- On the problem polyhedral separability: a numerical solution (Q268664) (← links)
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
- Strong convergence of hybrid Halpern iteration for Bregman totally quasi-asymptotically nonexpansive multi-valued mappings in reflexive Banach spaces with application (Q286927) (← links)
- Strong convergence theorem for quasi-Bregman strictly pseudocontractive mappings and equilibrium problems in Banach spaces (Q287540) (← links)
- On iterative computation of fixed points and optimization (Q287945) (← links)
- An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping (Q298439) (← links)
- Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds (Q328456) (← links)
- An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
- Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions (Q333517) (← links)
- Lagrange-type duality in DC programming problems with equivalent DC inequalities (Q340375) (← links)
- Positively homogeneous functions revisited (Q346810) (← links)
- Testing copositivity with the help of difference-of-convex optimization (Q359631) (← links)
- Strong convergence theorem for Bregman strongly nonexpansive mappings and equilibrium problems in reflexive Banach spaces (Q364597) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Convergence results for a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function (Q402509) (← links)
- Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation (Q439343) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Optimality conditions in terms of alternance: two approaches (Q462998) (← links)
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
- A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data (Q497436) (← links)
- Differentiable McCormick relaxations (Q522264) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- Quasi-concave density estimation (Q605936) (← links)
- Homogenization of a parabolic model of ferromagnetism (Q618281) (← links)
- Hamilton-Jacobi equations on graph and applications (Q681611) (← links)
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis (Q683297) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- A duality approach for a class of semivectorial bilevel programming problems (Q684051) (← links)
- Halpern's iteration for Bregman strongly nonexpansive mappings in reflexive Banach spaces (Q692282) (← links)
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Refined optimality conditions for differences of convex functions (Q708908) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- Cramér transform and \(t\)-entropy (Q743454) (← links)
- Overcoming the curse of dimensionality for some Hamilton-Jacobi partial differential equations via neural network architectures (Q783094) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- A proximal method for identifying active manifolds (Q839490) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- IQC analysis and synthesis via nonsmooth optimization (Q864474) (← links)
- Farkas-type results for max-functions and applications (Q865005) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
