An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
From MaRDI portal
Publication:2630834
DOI10.1007/s40305-015-0097-8zbMath1342.90224arXiv1509.06584OpenAlexW3105841909MaRDI QIDQ2630834
Rui Diao, Feng Ye, Ya-Feng Liu, Hong-Wei Liu
Publication date: 22 July 2016
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.06584
global convergencesmoothing approximationsmallest enclosing ballinexact gradientinexact Newton-CG algorithm
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Smooth minimization of non-smooth functions
- A new objective penalty function approach for solving constrained minimax problems
- A smoothing method for solving bilevel multiobjective programming problems
- Algorithms with adaptive smoothing for finite minimax problems
- Principal compliance and robust optimal design
- Smoothing methods for nonsmooth, nonconvex minimization
- On the limited memory BFGS method for large scale optimization
- On the smallest enclosing balls
- A truncated aggregate smoothing Newton method for minimax problems
- An aggregate function method for nonlinear programming
- Optimization. Algorithms and consistent approximations
- On the entropic regularization method for solving min-max problems with applications
- Efficient algorithms for the smallest enclosing ball problem
- Location analysis: a synthesis and survey
- Solution methodologies for the smallest enclosing circle problem
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
- Optimization theory and methods. Nonlinear programming
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Approximate clustering via core-sets
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A smoothing-out technique for min—max optimization
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Numerical Optimization
- Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms
- Testing of Clustering
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- An efficient, exact, and generic quadratic programming solver for geometric optimization
- Approximations for minimum and min-max vehicle routing problems
- The Minimum Covering Sphere Problem
- Smoothing method for minimax problems
- Choosing multiple parameters for support vector machines
