An approach to the solution of nonlinear unconstrained optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3847229
- Convex optimization problems with constraints
- An unconstrained convex programming approach to solving convex quadratic programming problems
- On reducibility of the general convex programming problem to an unconditional extremum problem
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
Cites work
Cited in
(11)- Optimization algorithms based on solving an equation which contains a reachability function
- Hybrid procedures for solving some unconstrained nonlinear optimization problems
- Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems
- scientific article; zbMATH DE number 3932802 (Why is no real title available?)
- scientific article; zbMATH DE number 3965830 (Why is no real title available?)
- scientific article; zbMATH DE number 44981 (Why is no real title available?)
- scientific article; zbMATH DE number 1069183 (Why is no real title available?)
- Empirical risk minimization and problems of constructing linear classifiers
- scientific article; zbMATH DE number 778131 (Why is no real title available?)
This page was built for publication: An approach to the solution of nonlinear unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040414)