scientific article; zbMATH DE number 3847229

MaRDI QIDQ3316971zbMATH OpenFDO

Authors A. Kaplan

Publication date 1981

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)

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

Cited in

(32)

• Solving Convex Programs by Means of Ordinary Differential Equations
• Convex optimization problems with constraints
• scientific article; zbMATH DE number 4057292 (Why is no real title available?)
• scientific article; zbMATH DE number 4130198 (Why is no real title available?)
• scientific article; zbMATH DE number 4045488 (Why is no real title available?)
• Constructing convex solutions via Perron's method
• scientific article; zbMATH DE number 3883964 (Why is no real title available?)
• 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
• On reduction of the quasi-convex programming problem to problem of unconstrained minimization by method of conical projection
• scientific article; zbMATH DE number 1533655 (Why is no real title available?)
• scientific article; zbMATH DE number 4176837 (Why is no real title available?)
• scientific article; zbMATH DE number 3902417 (Why is no real title available?)
• An approach to the solution of nonlinear unconstrained optimization problems
• A hadamard-stable extension of courant's sequential method for convex extremal problems
• A dual regularized method for solving a class of convex minimization problems
• A class of convex programming methods
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 6135095 (Why is no real title available?)
• scientific article; zbMATH DE number 3892943 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 605174 (Why is no real title available?)
• scientific article; zbMATH DE number 6027005 (Why is no real title available?)
• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• Value estimation approach to the Iri-Imai method for constrained convex optimization
• scientific article; zbMATH DE number 195139 (Why is no real title available?)
• On harmonic convexity (concavity) and application to non-linear programming problems.

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)