A gradient descent akin method for constrained optimization: algorithms and applications
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3679327 (Why is no real title available?)
- scientific article; zbMATH DE number 50725 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Algorithm 875
- Convex optimization algorithms
- Evaluating Derivatives
- Finite-time convergent gradient flows with applications to network consensus
- Interior Methods for Nonlinear Optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Introduction to Shape Optimization
- Linear and Nonlinear Programming
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Structural optimization using sensitivity analysis and a level-set method.
- THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- Variational methods for the solution of problems of equilibrium and vibrations
This page was built for publication: A gradient descent akin method for constrained optimization: algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238767)