scientific article; zbMATH DE number 51950
From MaRDI portal
Publication:4002322
Recommendations
Cited in
(77)- Extensions of subgradient projection algorithms
- A constrained min-max algorithm for rival models
- \(\epsilon\)-subgradient projection algorithm
- Study of practical stability problems by numerical methods and optimization of beam dynamics
- An algorithm for solving linearly constrained minimax problems
- A minimax problem admitting the equioscillation characterization of Bernstein and Erdös
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- A method for convex minimization based on translated first-order approximations
- A convergence analysis of the method of codifferential descent
- An active-set algorithm and a trust-region approach in constrained minimax problem
- On non-fragility of controllers for time delay systems: a numerical approach
- Design of the best linear classifier for box-constrained data sets
- Application of the subdifferential descent method to a classical nonsmooth variational problem
- 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
- Duality for generalized fractional programs involving n-set functions
- Examples of the best piecewise linear approximation with free nodes
- A smoothing iterative method for the finite minimax problem
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- The optimality conditions for generalized minimax programming
- Continuous minimax optimization using modal intervals
- The continuity of two functions associated with a maximin problem with connected variables
- Estimating the size of the calling population in finite-source election queues by bilinear programming techniques
- Estimates of reachable sets of control systems with nonlinearity and parametric perturbations
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Multi-material topology optimization for maximizing structural stability under thermo-mechanical loading
- The subdifferential descent method in a nonsmooth variational problem
- Primal interior point method for minimization of generalized minimax functions
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- Continuous min-max programs with semi-infinite constraints
- 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
- scientific article; zbMATH DE number 3927750 (Why is no real title available?)
- scientific article; zbMATH DE number 4032475 (Why is no real title available?)
- scientific article; zbMATH DE number 3737398 (Why is no real title available?)
- Differential properties of the spectral abscissa and the spectral radius for analytic matrix-valued mappings
- Optimum design accounting for the global nonlinear behavior of the model
- On synthesizing team target controls under obstacles and collision avoidance
- A new objective penalty function approach for solving constrained minimax problems
- Minimax Approach in a Multiple Criteria Stabilization of Singularly Perturbed Control
- scientific article; zbMATH DE number 7625188 (Why is no real title available?)
- Model-matching methods and distributed control of networks consisting of a class of heterogeneous dynamic agents
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
- On an inner estimate of a convex body by the Lebesgue set of convex differentiable function
- Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
- Spreading points using gradient and tabu
- On Euclidean norm approximations
- Directional differentiability, coexhausters, codifferentials and polyhedral DC functions
- Method for solving a differential inclusion with a subdifferentiable support function of the right-hand side
- Codifferentials and Quasidifferentials of the Expectation of Nonsmooth Random Integrands and Two-Stage Stochastic Programming
- Numerical solution of nonlinear \(m\)-dimensional Fredholm integral equations using iterative Newton-Cotes rules
- On Diferential Inclusions Arising from Some Discontinuous Systems
- Minimax asymptotics
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- Successive approximations method is used to solve nonlinear Volterra delay integral equations
- Steepest descent method for uncertain multiobjective optimization problems under finite uncertainty set
- On one consequence of the Chebyshev alternance
- Iterative cubic trapezoidal rule for the solution of mixed integral equations
- Calm local optimality for nonconvex-nonconcave minimax problems
- A new approach for solving minimax problems using new generation smoothing techniques
- Optimality conditions at infinity for nonsmooth minimax programming problems with some applications
- A new smoothing function technique for solving minimax problems
- Recent advances in minimax problem and bimatrix games
- Principal compliance and robust optimal design
- Method of quasidifferential descent in the problem of bringing a nonsmooth system from one point to another
- Optimality conditions and sensitivity analysis in parametric convex minimax programming
- Method for finding solution to ``quasidifferentiable differential inclusion
- A data mining algorithm via decentralized optimization in parallel or distributed systems: mathematical aspects
- Subgradient projection algorithm. II
- Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment
- Continuous-time fractional minmax programming
- A partially inexact bundle method for convex semi-infinite minmax problems
- An exact penalty function algorithm for time-lag control problems with control and terminal equality constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4002322)
