A truncated aggregate smoothing Newton method for minimax problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3930735 (Why is no real title available?)
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- scientific article; zbMATH DE number 1736456 (Why is no real title available?)
- scientific article; zbMATH DE number 2032319 (Why is no real title available?)
- scientific article; zbMATH DE number 895356 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A min-max resource allocation problem with substitutions
- A minimax optimal control problem
- A non-interior continuation method for generalized linear complementarity problems
- A smoothing-out technique for min—max optimization
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Algorithms with adaptive smoothing for finite minimax problems
- An Aggregate Constraint Method for Non-Linear Programming
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- An adjustable entropy function method
- An aggregate function method for nonlinear programming
- An algorithm for composite nonsmooth optimization problems
- Approximations for minimum and min-max vehicle routing problems
- Distance-constrained multifacility minimax location problems on tree networks
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- Generalized Bundle Methods
- Minimax approach to structural optimization problems
- Minimax resource allocation problems: Optimization and parametric analysis
- Nondifferential optimization via adaptive smoothing
- Numerical solution of minimax optimal control problems by multiple shooting technique
- On the -exponential trajectory of linear programming
- On the entropic regularization method for solving min-max problems with applications
- Optimization. Algorithms and consistent approximations
- Portfolio selection problem with minimax type risk function
- QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS
- Single Facility $l_p $-Distance Minimax Location
- Smooth Optimization Methods for Minimax Problems
- Smoothing method for minimax problems
- Solution of a min-max vehicle routing problem
- The Minisum and Minimax Location Problems Revisited
- The aggregate constraint homotopy method for nonconvex nonlinear programming
Cited in
(18)- Hyperbolic smoothing function method for minimax problems
- A smoothing trust-region Newton-CG method for minimax problems
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- The optimality conditions for generalized minimax programming
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- An aggregate homotopy method for solving unconstrained minimax problems
- Some properties of a smoothing approximation for maximum function
- Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
- A truncated smoothing Newton method for \(l_\infty\) fitting rotated cones
- An active set smoothing method for solving unconstrained minimax problems
- A homotopy method based on penalty function for nonlinear semidefinite programming
- 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
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- Zero duality gap in surrogate constraint optimization: a concise review of models
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- A spline smoothing Newton method for finite minimax problems
This page was built for publication: A truncated aggregate smoothing Newton method for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979271)
