Global minimum point of a convex function

DOI10.1016/0096-3003(93)90022-7zbMath0778.65046OpenAlexW2071427770MaRDI QIDQ2365620

Yanyan Li

Publication date: 29 June 1993

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/38316

zbMATH Keywords

convex optimizationlarge-scale problemsglobal minimizerstrictly convex functionconstructive homotopy method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (19)

On the existence of zero points ⋮ On the number of zeros of a mapping ⋮ A stable solution. ⋮ Operators that are weakly coercive and a compact perturbation ⋮ Continuation methods and condensing mappings ⋮ Stable and unstable stationary trajectories ⋮ A regular value of compact deformation ⋮ Compact perturbations of a strongly positive operator ⋮ Weakly coercive mappings sharing a value ⋮ Existence and computation of zeros of perturbed mappings ⋮ Compact embeddings and proper mappings ⋮ Compact perturbations of a linear homeomorphism ⋮ Extremum points of a convex function ⋮ Continuous embeddings and continuation methods ⋮ Existence of zeros for bounded perturbations of proper mappings ⋮ Mappings sharing a value on finite-dimensional spaces ⋮ Open trajectories. ⋮ A compactness condition. ⋮ A second zero of a function.

Cites Work

• A special type of triangulations in numerical nonlinear analysis
• Another Proof that Convex Functions are Locally Lipschitz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Global minimum point of a convex function