scientific article; zbMATH DE number 3847229

zbMATH Open0533.90071MaRDI QIDQ3316971FDOQ3316971

Authors: A. Kaplan 

Publication date: 1981

Title of this publication is not available (Why is that?)

Recommendations

• Mixed method for solving the general convex programming problem
• scientific article; zbMATH DE number 4057292
• scientific article; zbMATH DE number 3850830
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• A dual regularized method for solving a class of convex minimization problems

zbMATH Keywords

regularizationconvergence conditions425.65035estimation of the optimal valuesequence of unconstrained minimizations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited In (32)

• Solving Convex Programs by Means of Ordinary Differential Equations
• Convex optimization problems with constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructing convex solutions via Perron's method
• Title not available (Why is that?)
• Automatic repair of convex optimization problems
• Solving the Gleason problem on linearly convex domains
• A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
• Title not available (Why is that?)
• On reduction of the quasi-convex programming problem to problem of unconstrained minimization by method of conical projection
• Title not available (Why is that?)
• Title not available (Why is that?)
• A hadamard-stable extension of courant's sequential method for convex extremal problems
• An approach to the solution of nonlinear unconstrained optimization problems
• A dual regularized method for solving a class of convex minimization problems
• A class of convex programming methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex and convex-like optimization over a range inclusion problem and first applications
• Modification of the parametrized method of centers
• On the convexification of nonlinear programming problems: An applications-oriented survey
• The method of convex programming with a prescribed absolute-relative error
• A numerical approach for solving some convex maximization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Value estimation approach to the Iri-Imai method for constrained convex optimization
• On harmonic convexity (concavity) and application to non-linear programming problems.
• Using convex envelopes to solve the interactive fixed-charge linear programming problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316971)