Some methods of solving convex programming problems

DOI10.1016/0041-5553(81)90007-0zbMath0497.90052MaRDI QIDQ3962783

V. M. Panin

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0041-5553(81)90007-0

zbMATH Keywords

Newton's method; first-order method; solution algorithms; method of linearization; convergence prove; methods with quadratic approximation of the constraints; step choice rule

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

Related Items

A Globally Convergent SQCQP Method for Multiobjective Optimization Problems, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results, On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems, A sequential quadratically constrained quadratic programming method of feasible directions, Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment