A truncated aggregate smoothing Newton method for minimax problems
From MaRDI portal
Publication:979271
DOI10.1016/J.AMC.2009.11.034zbMATH Open1194.65083OpenAlexW2016115300MaRDI QIDQ979271FDOQ979271
Publication date: 25 June 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.11.034
Recommendations
numerical resultsalgorithmglobal convergenceminimax problemslocally quadratic convergencestabilized Newton methodtruncated aggregate function
Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Methods of quasi-Newton type (90C53)
Cites Work
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smooth Optimization Methods for Minimax Problems
- Optimization. Algorithms and consistent approximations
- Generalized Bundle Methods
- An aggregate function method for nonlinear programming
- Nondifferential optimization via adaptive smoothing
- Minimax approach to structural optimization problems
- The Minisum and Minimax Location Problems Revisited
- Algorithms with adaptive smoothing for finite minimax problems
- Title not available (Why is that?)
- Single Facility $l_p $-Distance Minimax Location
- A smoothing-out technique for min—max optimization
- Solution of a min-max vehicle routing problem
- Smoothing method for minimax problems
- Distance-constrained multifacility minimax location problems on tree networks
- Approximations for minimum and min-max vehicle routing problems
- A minimax optimal control problem
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- Portfolio selection problem with minimax type risk function
- Numerical solution of minimax optimal control problems by multiple shooting technique
- 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
- A non-interior continuation method for generalized linear complementarity problems
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- On the entropic regularization method for solving min-max problems with applications
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimax resource allocation problems: Optimization and parametric analysis
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- An algorithm for composite nonsmooth optimization problems
- Title not available (Why is that?)
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- Title not available (Why is that?)
- A min-max resource allocation problem with substitutions
- On the \(\log\)-exponential trajectory of linear programming
- QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS
- An adjustable entropy function method
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
- The smoothing conjugate gradient method for a kind of generalized polynomial complementarity problem
- A homotopy method based on penalty function for nonlinear semidefinite programming
- 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)
