A practical approach to optimization
From MaRDI portal
Abstract: We present a new approach for finding a minimal value of an arbitrary function assuming only its continuity. The process avoids verifying Lagrange- or KKT-conditions. The method enables us to obtain a Brouwer fixed point (of a continuous function mapping from a cube into itself).
Recommendations
Cites work
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- A graphical proof of the Brouwer fixed point theorem
- A simple proof of the Brouwer fixed point theorem
- A trust region method based on interior point techniques for nonlinear programming.
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Analysis of Generalized Pattern Searches
- Evolutionary algorithms applied to multi-objective aerodynamic shape optimization
- scientific article; zbMATH DE number 3746761 (Why is no real title available?)
- scientific article; zbMATH DE number 7333663 (Why is no real title available?)
Cited in
(6)- Paths, pivots, and practice: the power of optimization
- scientific article; zbMATH DE number 3935838 (Why is no real title available?)
- Practical Optimization
- A Priori Optimization
- A practical approach to quasi-convex optimization
- Random fixed point theorems with application to random differential equations in separable suprametric spaces endowed with a graph
This page was built for publication: A practical approach to optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992956)