Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software (Q1923346): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FSQP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PADMOS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0096-3003(96)00002-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081433316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method to Solve the Minimax Problem Directly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximations algorithm for computer-aided design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical basis for satisficing decision making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3354783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of discrete systems involving delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truncated Newton method for sparse unconstrained optimization using automatic differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 746: PCOMP—a Fortran code for automatic differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic differentiation: techniques and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878822 / rank
 
Normal rank

Latest revision as of 14:40, 24 May 2024

scientific article
Language Label Description Also known as
English
Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software
scientific article

    Statements

    Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software (English)
    0 references
    0 references
    0 references
    12 November 1996
    0 references
    An interactive environment for the solution of mathematical programming problems is discussed. It is shown how to solve various optimal control problems in this environment.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic optimization
    0 references
    interactive environment
    0 references
    optimal control problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references