[go: up one dir, main page]

Kortanek et al., 1993 - Google Patents

A central cutting plane algorithm for convex semi-infinite programming problems

Kortanek et al., 1993

Document ID
14577037328198173124
Author
Kortanek K
No H
Publication year
Publication venue
SIAM Journal on optimization

External Links

Snippet

The central cutting plane algorithm for linear semi-infinite programming (SIP) is extended to nonlinear convex SIP of the form min {f(x)|x∈H,g(x,t)≦0all\,t∈S\}. Under differentiability assumptions that are weaker than those employed in superlinearly convergent algorithms, a …
Continue reading at epubs.siam.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30389—Query formulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management

Similar Documents

Publication Publication Date Title
Kortanek et al. A central cutting plane algorithm for convex semi-infinite programming problems
Chambers Fitting nonlinear models: numerical techniques
Botta et al. Characterizations of generalized hyperexponential distribution functions
US6986109B2 (en) Practical method for hierarchical-preserving layout optimization of integrated circuit layout
US9424232B2 (en) Processing of linear systems of equations
Thielemans An Algorithmic Approach to Operator Product Expansions, $ W $-Algebras and $ W $-Strings
Ito et al. A dual parametrization method for convex semi-infinite programming
CN105677645B (en) A kind of tables of data comparison method and device
US20170193378A1 (en) System and method for rapid and robust uncertainty management during multidisciplinary analysis
Celledoni et al. A class of intrinsic schemes for orthogonal integration
Malajovich et al. On the geometry of Graeffe iteration
Ratschek et al. Geometric computations with interval and new robust methods: applications in computer graphics, GIS and computational geometry
Buvoli et al. Constructing new time integrators using interpolating polynomials
Becher et al. A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity
Hüls et al. Analyzing Hybrid Petri nets with multiple stochastic firings using HyPro
Tam Parallel methods for the numerical solution of ordinary differential equations
Robinson et al. Subspace accelerated matrix splitting algorithms for asymmetric and symmetric linear complementarity problems
Börner et al. The functional equation for L-functions of hyperelliptic curves
Smith et al. Probabilistic parameter uncertainty analysis of single input single output control systems
Giesbrecht et al. Computing approximate greatest common right divisors of differential polynomials
Frehse et al. Space-time interpolants
Miller An inexact bundle method for solving large structured linear matrix inequalities
McDonough Lectures in Basic computational numerical analysis
Fernández et al. Interval tools in branch-and-bound methods for global optimization
Rouigueb et al. Integration of polynomials over n-dimensional simplices