scientific article

Vasily N. Malozemov, V. F. Dem'yanov

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

best approximation successive approximation directional differentiability discrete minimax problem

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Existence of solutions for minimax problems (49J35) Optimality conditions for minimax problems (49K35)

Related Items (58)

Extensions of subgradient projection algorithms ⋮ On an Inner Estimate of a Convex Body by the Lebesgue Set of Convex Differentiable Function ⋮ Estimates of reachable sets of control systems with nonlinearity and parametric perturbations ⋮ Minimax Approach in a Multiple Criteria Stabilization of Singularly Perturbed Control ⋮ Triangular functions for numerical solution of the nonlinear Volterra integral equations ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ Optimality conditions and duality for a class of continuous-time generalized fractional programming problems ⋮ A constrained min-max algorithm for rival models ⋮ \(\epsilon\)-subgradient projection algorithm ⋮ Positively homogeneous functions revisited ⋮ Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions ⋮ Second-order minimization method for nonsmooth functions allowing convex quadratic approximations of the augment ⋮ Study of practical stability problems by numerical methods and optimization of beam dynamics ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Model-matching methods and distributed control of networks consisting of a class of heterogeneous dynamic agents ⋮ A method for convex minimization based on translated first-order approximations ⋮ On Euclidean norm approximations ⋮ Differential properties of the spectral abscissa and the spectral radius for analytic matrix-valued mappings ⋮ Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ Spreading points using gradient and tabu ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ Unnamed Item ⋮ Directional differentiability, coexhausters, codifferentials and polyhedral DC functions ⋮ Method for solving a differential inclusion with a subdifferentiable support function of the right-hand side ⋮ On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ Multi-material topology optimization for maximizing structural stability under thermo-mechanical loading ⋮ The subdifferential descent method in a nonsmooth variational problem ⋮ An exact penalty function algorithm for time-lag control problems with control and terminal equality constraints ⋮ Unnamed Item ⋮ An algorithm for solving linearly constrained minimax problems ⋮ Optimum design accounting for the global nonlinear behavior of the model ⋮ Unnamed Item ⋮ Codifferentials and Quasidifferentials of the Expectation of Nonsmooth Random Integrands and Two-Stage Stochastic Programming ⋮ On synthesizing team target controls under obstacles and collision avoidance ⋮ Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema ⋮ The optimality conditions for generalized minimax programming ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ Continuous minimax optimization using modal intervals ⋮ The continuity of two functions associated with a maximin problem with connected variables ⋮ Unnamed Item ⋮ Estimating the size of the calling population in finite-source election queues by bilinear programming techniques ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem ⋮ The performance of an eigenvalue bound on the max-cut problem in some classes of graphs ⋮ Limiting behaviour of the approximate first order and second order directional derivatives for a convex function ⋮ A convergence analysis of the method of codifferential descent ⋮ Principal compliance and robust optimal design ⋮ Duality for generalized fractional programs involving n-set functions ⋮ On non-fragility of controllers for time delay systems: a numerical approach ⋮ Examples of the best piecewise linear approximation with free nodes ⋮ A smoothing iterative method for the finite minimax problem ⋮ Design of the best linear classifier for box-constrained data sets ⋮ Necessary and sufficient conditions for emptiness of the cones of generalized support vectors ⋮ Subgradient projection algorithm. II ⋮ Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment ⋮ Application of the subdifferential descent method to a classical nonsmooth variational problem ⋮ Continuous-time fractional minmax programming

This page was built for publication: