Newton's method for convex programming and Tschebyscheff approximation

From MaRDI portal

Publication:1131571

Jump to:navigation, search

DOI10.1007/BF01386389zbMath0113.10703OpenAlexW1982511487WikidataQ97724060 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

zbMATH Keywords

numerical analysis

Related Items

A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, Survey of Bundle Methods for Nonsmooth Optimization, DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, 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, Unnamed Item, A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization, Design of input matrices of stabilizing controllers for uncertain systems, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, Optimization of lipschitz continuous functions, Essentials of numerical nonsmooth optimization, An algorithm of successive minimization in convex programming, IDENTIFICATION OF REDUNDANT OBJECTIVE FUNCTIONS IN MULTI-OBJECTIVE STOCHASTIC FRACTIONAL PROGRAMMING PROBLEMS, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, A splitting bundle approach for non-smooth non-convex minimization, Essentials of numerical nonsmooth optimization, Zum heutigen Stand der nichtlinearen Optimierungstheorie, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Lagrangean relaxation. (With comments and rejoinder)., An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, Solving general continuous single facility location problems by cutting planes, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Tuning strategy for the proximity parameter in convex minimization, On the stability of rational approximation, The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm, Some outer approximation methods for semi-infinite optimization problems, Optimal value function in semi-infinite programming, Deletion-by-infeasibility rule for DC-constrained global optimization, Outer approximation method incorporating a quadratic approximation for a DC programming problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, Outer approximation by polyhedral convex sets, Variable metric bundle methods: From conceptual to implementable forms, Solving variational inequalities defined on a domain with infinitely many linear constraints, A logarithmic barrier cutting plane method for convex programming, Dynamic bundle methods, Piecewise linear approximations in nonconvex nonsmooth optimization, An optimal variant of Kelley's cutting-plane method, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, A simple method for convex optimization in the oracle model, A bundle-type algorithm for routing in telecommunication data networks, A bundle modification strategy for convex minimization, The proximal Chebychev center cutting plane algorithm for convex additive functions, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, A quasi-second-order proximal bundle algorithm, Cutting sphere algorithm, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Canonical DC programming problem: Outer approximation methods revisited, Optimizing production capacity and safety stocks in general acyclic supply chains, Implementing the simplex method as a cutting-plane method, with a view to regularization, New variants of bundle methods, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, On the approximation of unbounded convex sets by polyhedra, A method for convex minimization based on translated first-order approximations, A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem, A simple version of bundle method with linear programming, A decomposition algorithm for KYP-SDPs, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, A cutting-plane algorithm with linear and geometric rates of convergence, A maximization method for a class of quasiconcave programs, A Support Function Based Algorithm for Optimization with Eigenvalue Constraints, A partially inexact bundle method for convex semi-infinite minmax problems, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, A cutting plane method for solving KYP-SDPs, A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions, Large-scale convex optimization methods for air quality policy assessment., Constrained nonconvex nonsmooth optimization via proximal bundle method, A central cutting plane algorithm for the convex programming problem, Convex proximal bundle methods in depth: a unified analysis for inexact oracles, Solving DC programs using the cutting angle method, Formulations and exact algorithms for the vehicle routing problem with time windows, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, On an outer approximation concept in global optimization, A cutting plane method for solving minimax problems in the complex plane, Comparison of bundle and classical column generation, Cutting plane algorithms and approximate lower subdifferentiability, Globally convergent cutting plane method for nonconvex nonsmooth minimization, An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, A one-parameter filled function for nonsmooth global optimization and its application, Bounded lower subdifferentiability optimization techniques: applications, Robust network design in telecommunications under polytope demand uncertainty, On the use of outer approximations as an external active set strategy, Lagrangian duality applied to the vehicle routing problem with time windows, Computational aspects of cutting-plane algorithms for geometric programming problems, Minimization methods with constraints, Approximation methods for the unconstrained optimization, Extremization of multi-objective stochastic fractional programming problem -- an application to assembled printed circuit board problem, Derivative-free robust optimization by outer approximations, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Comparative study of RPSALG algorithm for convex semi-infinite programming, A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, A unifying framework for several cutting plane methods for semidefinite programming, A comparison of primal and dual methods of linear programming, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, An inexact bundle variant suited to column generation, 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 cutting plane algorithm for MV portfolio selection model, An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems, Cauchy's method of minimization, Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method, A bundle-Newton method for nonsmooth unconstrained minimization, A new restricted memory level bundle method for constrained convex nonsmooth optimization, On the convergence of a class of outer approximation algorithms for convex programs, A primal-proximal heuristic applied to the French unit-commitment problem, Approximation in normed linear spaces, Lower subdifferentiable functions and their minimization by cutting planes, A \(\mathcal{VU}\)-algorithm for convex minimization, Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems, Convergence of some algorithms for convex minimization

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1131571&oldid=13179673"