Pages that link to "Item:Q1366322"

The following pages link to On the entropic regularization method for solving min-max problems with applications (Q1366322):

Displaying 42 items.

• A generalized neural network for solving a class of minimax optimization problems with linear constraints (Q433302) (← links)
• A nonmonotone line search based algorithm for distribution center location selected (Q477492) (← links)
• A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
• A smoothing method for zero--one constrained extremum problems (Q637567) (← links)
• Design of computer experiments: space filling and beyond (Q693293) (← links)
• On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
• An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
• A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
• Solving mathematical programs with fuzzy equilibrium constraints (Q979851) (← links)
• Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
• Solving variational inequalities in a fuzzy environment (Q1587442) (← links)
• Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions (Q1591926) (← links)
• Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems (Q1683936) (← links)
• A dual algorithm for minimax problems (Q1767399) (← links)
• A regularized approach for frictional impact dynamics of flexible multi-link manipulator arms considering the dynamic stiffening effect (Q1789377) (← links)
• An entropic regularization approach for mathematical programs with equilibrium constraints (Q1886001) (← links)
• An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
• Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
• On smooth relaxations of obstacle sets (Q2254177) (← links)
• Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
• A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
• A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints (Q2299749) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• Variable programming: a generalized minimax problem. II: Algorithms (Q2488054) (← links)
• An efficient algorithm for the Euclidean \(r\)-centrum location problem (Q2570749) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• The optimization technique for solving a class of non-differentiable programming based on neural network method (Q2655120) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
• An Equivalent Identification Method for Dynamic Loads Acting on Nonlinear Structures (Q3383776) (← links)
• A relaxed cutting plane algorithm for solving fuzzy inequality systems (Q4265518) (← links)
• (Q4308925) (← links)
• An aggregate homotopy method for solving unconstrained minimax problems (Q5009167) (← links)
• (Q5055095) (← links)
• Truncated aggregate homotopy method for nonconvex nonlinear programming (Q5746690) (← links)
• Smoothing method for minimizing the sum of the<i>r</i>largest functions (Q5758222) (← links)
• Solving fuzzy variational inequalities over a compact set (Q5936077) (← links)
• Time-domain Galerkin method for dynamic load identification (Q6558891) (← links)
• Pontryagin-type maximum principle for a controlled sweeping process with nonsmooth and unbounded sweeping set (Q6620686) (← links)
• Numerical method for a controlled sweeping process with nonsmooth sweeping set (Q6644244) (← links)