Results 131 to 140 of about 1,804,722 (202)

Outer Approximation Algorithms for DC Programs and Beyond [PDF]

, 2008
We consider the well-known Canonical DC (CDC) optimization problem, relying on an alternative equivalent formulation based on a polar characterization of the constraint, and a novel generalization of this problem, which we name Single Reverse Polar ...
ZHANG, QINGHUA
core  

Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves

Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena, Jeremy T. Tyson   +1 more
wiley   +1 more source

Nonconvex robust optimization [PDF]

, 2007
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.This electronic version was submitted by the student author.
Teo, Kwong Meng, Kwong Meng Teo
core  

H-infinity via a nonsmooth, nonconvex optimization approach

, 2005
A numerical method for solving the H-infinity synthesis problem is presented. The problem is posed as an unconstrained, nonsmooth, nonconvex minimization problem. The optimization variables consist solely of the entries of the output feedback matrix.
Mammadov, Musa, Orsi, Robert
core  

A fast algorithm for sparse signal recovery via fraction function

Electronics Letters
In this article, a fast algorithm is studied to recover the sparse signals. It can be regarded as an extension of the parameterized fast iterative shrinkage‐thresholding algorithm from convex optimization to nonconvex optimization. Numerical results show
Angang Cui, Haizhen He, Hong Yang
doaj   +1 more source

Why Methods for Optimization Problems with Time-Consuming Function Evaluations and Integer Variables Should Use Global Approximation Models [PDF]

This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of ...
Brekelmans, R.C.M., Gerichhausen, M., Hamers, H.J.M., Hertog, D. den, Driessen, L.   +4 more
core  

Distributed Nonconvex Optimization for Control of Water Networks with Time-coupling Constraints. [PDF]

Water Resour Manag (Dordr)
Jenks B, Ulusoy AJ, Pecci F, Stoianov I.
europepmc   +1 more source

Simultaneous Activity and Attenuation Estimation in TOF-PET With TV-Constrained Nonconvex Optimization. [PDF]

IEEE Trans Med Imaging
Ren Z, Sidky EY, Barber RF, Kao CM, Pan X.   +4 more
europepmc   +1 more source

Data and performance profiles applying an adaptive truncation criterion, within linesearch-based truncated Newton methods, in large scale nonconvex optimization. [PDF]

Data Brief, 2018
Caliciotti A, Fasano G, Nash SG, Roma M.
europepmc   +1 more source

On the Complexity of Optimization over the Standard Simplex [PDF]

We review complexity results for minimizing polynomials over the standard simplex and unit hypercube.In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with ...
Klerk, E. de, Hertog, D. den, Elfadul, G.E.E.   +2 more
core