Newton's method for convex programming and Tschebyscheff approximation
From MaRDI portal
Publication:1131571
DOI10.1007/BF01386389zbMath0113.10703WikidataQ97724060 ScholiaQ97724060MaRDI QIDQ1131571
E. W. Cheney, Allen A. Goldstein
Publication date: 1959
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131435
Related Items
DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, Survey of Bundle Methods for Nonsmooth Optimization, Design of input matrices of stabilizing controllers for uncertain systems, Unnamed Item, IDENTIFICATION OF REDUNDANT OBJECTIVE FUNCTIONS IN MULTI-OBJECTIVE STOCHASTIC FRACTIONAL PROGRAMMING PROBLEMS, Zum heutigen Stand der nichtlinearen Optimierungstheorie, Tchebycheff Approximation in Several Variables, An algorithm for linear optimal control systems with state-space constraints†, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, Cutting sphere algorithm, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Cauchy's method of minimization, On the convergence of a class of outer approximation algorithms for convex programs, Lower subdifferentiable functions and their minimization by cutting planes, A bundle modification strategy for convex minimization, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, An inexact bundle variant suited to column generation, Solving general continuous single facility location problems by cutting planes, The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm, Optimal value function in semi-infinite programming, Outer approximation by polyhedral convex sets, A cutting-plane algorithm with linear and geometric rates of convergence, A maximization method for a class of quasiconcave programs, A cutting plane method for solving minimax problems in the complex plane, Minimization methods with constraints, Approximation methods for the unconstrained optimization, A bundle-Newton method for nonsmooth unconstrained minimization, Convergence of some algorithms for convex minimization, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Some outer approximation methods for semi-infinite optimization problems, Variable metric bundle methods: From conceptual to implementable forms, Large-scale convex optimization methods for air quality policy assessment., Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method, Approximation in normed linear spaces, Lagrangean relaxation. (With comments and rejoinder)., Deletion-by-infeasibility rule for DC-constrained global optimization, A logarithmic barrier cutting plane method for convex programming, A quasi-second-order proximal bundle algorithm, Canonical DC programming problem: Outer approximation methods revisited, New variants of bundle methods, Tuning strategy for the proximity parameter in convex minimization, Formulations and exact algorithms for the vehicle routing problem with time windows, Comparison of bundle and classical column generation, Lagrangian duality applied to the vehicle routing problem with time windows, Extremization of multi-objective stochastic fractional programming problem -- an application to assembled printed circuit board problem, A comparison of primal and dual methods of linear programming, Tschebyscheff-Approximation im Bereich der rationalen Funktionen bei Vorliegen einer guten Ausgangsnäherung, Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen Funktionen, On iterative methods for solving nonlinear least squares problems over convex sets, Cubature and the Tchakaloff cone, Eine Lösungsmethode für die lineare Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung, Cutting plane algorithms and state space constrained linear optimal control problems, A primal-proximal heuristic applied to the French unit-commitment problem, A \(\mathcal{VU}\)-algorithm for convex minimization, On the stability of rational approximation, Solving variational inequalities defined on a domain with infinitely many linear constraints, A unifying framework for several cutting plane methods for semidefinite programming, On an outer approximation concept in global optimization, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, A central cutting plane algorithm for the convex programming problem, Computational aspects of cutting-plane algorithms for geometric programming problems, A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems, Optimization of lipschitz continuous functions, An algorithm of successive minimization in convex programming
Cites Work
- A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations
- Über diskrete und lineare Tschebyscheff-Approximationen
- Chebychev Approximation in Locally Compact Spaces
- Proximity Maps for Convex Sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
