Computational efficiency of the simplex embedding method in convex nondifferentiable optimization

DOI10.1134/S0965542518020070zbMATH Open1397.90311OpenAlexW2791670896MaRDI QIDQ1644014FDOQ1644014

Authors: A. V. Kolosnitsyn 

Publication date: 21 June 2018

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542518020070

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

zbMATH Keywords

convex nondifferentiable optimizationcentered cutting methodmodified simplex embedding method

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26)

Cites Work

• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Title not available (Why is that?)
• Linear convergence of epsilon-subgradient descent methods for a class of convex functions
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Cutting-Plane Method for Solving Convex Programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The traveling-salesman problem and minimum spanning trees: Part II
• Title not available (Why is that?)
• Newton's method for convex programming and Tschebyscheff approximation
• Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence of conjugate gradient methods with constant stepsizes
• Title not available (Why is that?)
• Method of conjugate subgradients with constrained memory
• Introduction to Nonsmooth Optimization
• Title not available (Why is that?)
• A modified simplex immersions method with simultaneous introduction of several intersecting planes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
• Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices

Uses Software

• PLCP
• SQPlab

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)