A continuous method for convex programming problems
From MaRDI portal
Recommendations
- Continuous second-order linearization method for convex programming problems
- A continuation method for solving convex programming problemsviafischer reformulation
- Convex programming algorithm with a modified Lagrange function
- ODE methods for solving convex programming problems with bounded variables
- scientific article; zbMATH DE number 994242
Cites work
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Inexact implicit methods for monotone general variational inequalities
- Neural networks and physical systems with emergent collective computational abilities
- Neurodynamical optimization
- Neurons with graded response have collective computational properties like those of two-state neurons
- On the basic theorem of complementarity
- Sliding Modes in Solving Convex Programming Problems
- Solving Convex Programs by Means of Ordinary Differential Equations
- Solving variational inequalities with coupling contraints with the use of differential equations
- Stability analysis of gradient-based neural networks for optimization problems
Cited in
(21)- A forward convex-simplex method
- Continuous second-order linearization method for convex programming problems
- A gradient-based continuous method for large-scale optimization problems
- A novel neural dynamical approach to convex quadratic program and its efficient applications
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
- Constructing convex solutions via Perron's method
- A continuous method model for solving general variational inequality
- scientific article; zbMATH DE number 3847234 (Why is no real title available?)
- scientific article; zbMATH DE number 4212887 (Why is no real title available?)
- ODE methods for solving convex programming problems with bounded variables
- scientific article; zbMATH DE number 5670876 (Why is no real title available?)
- scientific article; zbMATH DE number 3902414 (Why is no real title available?)
- scientific article; zbMATH DE number 1855674 (Why is no real title available?)
- scientific article; zbMATH DE number 6135095 (Why is no real title available?)
- A continuation method for solving convex programming problemsviafischer reformulation
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- On the relationship between the integer and continuous solutions of convex programs
- Bi-affine scaling iterative method for convex quadratic programming with bound constraints
- A continuous algorithm for finding the saddle points of convex-concave functions
- Steplengths in the extragradient type methods
- Series solution of the multispecies Lotka-Volterra equations by means of the homotopy analysis method
This page was built for publication: A continuous method for convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774044)
