Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
From MaRDI portal
Publication:1644014
Recommendations
- An algorithm of simplex imbeddings in convex programming
- Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
- On a method of simplex embeddings in convex programming.
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
- Convex optimization techniques due to Nestrov and computational complexity
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- scientific article; zbMATH DE number 1159281
- The Efficiency of the Simplex Method: A Survey
- Simplex-inspired algorithms for solving a class of convex programming problems
- Numerical methods for nondifferentiable convex optimization
Cites work
- scientific article; zbMATH DE number 3830713 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 3516928 (Why is no real title available?)
- scientific article; zbMATH DE number 3570200 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 195045 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 3428782 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3304564 (Why is no real title available?)
- scientific article; zbMATH DE number 3338981 (Why is no real title available?)
- scientific article; zbMATH DE number 3344071 (Why is no real title available?)
- scientific article; zbMATH DE number 3371851 (Why is no real title available?)
- scientific article; zbMATH DE number 3402056 (Why is no real title available?)
- scientific article; zbMATH DE number 3189475 (Why is no real title available?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A modified simplex immersions method with simultaneous introduction of several intersecting planes
- Convergence of conjugate gradient methods with constant stepsizes
- Introduction to nonsmooth optimization. Theory, practice and software
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Method of conjugate subgradients with constrained memory
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- The Cutting-Plane Method for Solving Convex Programs
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The traveling-salesman problem and minimum spanning trees: Part II
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
Cited in
(3)- Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
- Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
- Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
This page was built for publication: Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644014)
