A smooth method for the finite minimax problem
From MaRDI portal
(Redirected from Publication:689121)
Recommendations
Cites work
- scientific article; zbMATH DE number 4141383 (Why is no real title available?)
- scientific article; zbMATH DE number 3930735 (Why is no real title available?)
- scientific article; zbMATH DE number 16320 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3628727 (Why is no real title available?)
- scientific article; zbMATH DE number 4114401 (Why is no real title available?)
- scientific article; zbMATH DE number 3804766 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A model algorithm for composite nondifferentiable optimization problems
- A multiplier method with automatic limitation of penalty growth
- A smoothing-out technique for min—max optimization
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Efficient Method to Solve the Minimax Problem Directly
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Combined lp and quasi-Newton methods for minimax optimization
- Methods of descent for nondifferentiable optimization
- New Results on a Continuously Differentiable Exact Penalty Function
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Smooth Optimization Methods for Minimax Problems
- Superlinearly convergent algorithm for min-max problems
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(65)- An aggregate homotopy method for solving unconstrained minimax problems
- The smoothing conjugate gradient method for a kind of generalized polynomial complementarity problem
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Essentials of numerical nonsmooth optimization
- A method of seeking the stationary points of a connected max-min
- A new objective penalty function approach for solving constrained minimax problems
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- Solving mathematical programs with fuzzy equilibrium constraints
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- On penalty methods for minimax problems
- Solving min-max problems and linear semi-infinite programs
- Further study on a dual algorithm
- A dual algorithm for minimax problems
- A fast gradient and function sampling method for finite-max functions
- A proximal-projection partial bundle method for convex constrained minimax problems
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- Solution of minimax problems using equivalent differentiable functions
- An adaptive smoothing method for continuous minimax problems
- An active set smoothing method for solving unconstrained minimax problems
- Solving minimax problems: local smoothing versus global smoothing
- Constraint incorporation in optimization
- Optimal covering of plane domains by circles via hyperbolic smoothing
- An interior point algorithm for continuous minimax: implementation and computation
- Variable programming: a generalized minimax problem. II: Algorithms
- Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- scientific article; zbMATH DE number 2032319 (Why is no real title available?)
- A parametric embedding for the finite minimax problem
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Smooth transformation of the generalized minimax problem
- Directions of decrease for minimax problems
- On the entropic regularization method for solving min-max problems with applications
- A hybrid algorithm for linearly constrained minimax problems
- Solving fuzzy variational inequalities over a compact set
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- A relaxed cutting plane algorithm for solving fuzzy inequality systems
- Exact Solutions for Minimax Optimization Problems
- A minimax model and arithmetic for initial emission permits
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Algorithms with adaptive smoothing for finite minimax problems
- The solution of discrete minimax problems
- Essentials of numerical nonsmooth optimization
- Solving variational inequalities in a fuzzy environment
- Exact barrier function methods for Lipschitz programs
- Uniform approximation of min/max functions by smooth splines
- Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
- Minmaxmin problems revisited
- An active-set algorithm and a trust-region approach in constrained minimax problem
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- A hybrid algorithm for nonlinear minimax problems
- A projected conjugate gradient method for sparse minimax problems
- New exact penalty function for solving constrained finite min-max problems
- scientific article; zbMATH DE number 3911152 (Why is no real title available?)
- A barrier function method for minimax problems
- A note on solving nonlinear minimax problems via a differentiable penalty function
- An effective adaptive trust region algorithm for nonsmooth minimization
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- A nonlinear augmented Lagrangian for constrained minimax problems
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- Smooth Optimization Methods for Minimax Problems
- Finite-sum smooth optimization with SARAH
- A nonmonotone line search based algorithm for distribution center location selected
- A derivative-free trust-region algorithm for composite nonsmooth optimization
This page was built for publication: A smooth method for the finite minimax problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689121)
