An approach to nonlinear programming
From MaRDI portal
Publication:2553907
Cites work
Cited in
(only showing first 100 items - show all)- Optimal switching instants for a switched-capacitor DC/DC power converter
- Optimal solutions to a class of power management problems in mobile robots
- Analysis of supply contracts with quantity flexibility
- Analytical and numerical investigation of strain-hardening viscoplastic thick-walled cylinders under internal pressure by using sequential limit analysis
- An adaptive method for homogenization in orthotropic nonlinear elasticity
- Efficient and modular algorithms in modeling finite inelastic deformations: objective integration, parameter identification and sub-stepping techniques
- Modulability and duality of certain cones in pluripotential theory
- Adaptive fuzzy backstepping approach for temperature control of continuous stirred tank reactors
- A linear programming-based optimization algorithm for solving nonlinear programming problems
- The segment method as an alternative to minimax in hypothesis testing
- A unified approach to finite deformation elastoplastic analysis based on the use of hyperelastic constitutive equations
- A two-level iteration method for solution of contact problems
- C-programming. An outline
- A unified derivation for fast estimation algorithms by the conjugate direction method
- Asymptotically optimum recursive prediction error methods in adaptive estimation and control
- The brain-state-in-a-box neural model is a gradient descent algorithm
- Recursive solution of the covariance equations for linear prediction
- Extremal properties of lung models in retention-solubility studies
- Convergence rate determination for gradient-based adaptive estimators
- Exploitative competition in a chemostat for two complementary, and possibly inhibitory, resources
- Primal-dual properties of sequential gradient-restoration algorithms for optimal control problems. II: General problem
- Lognormal law for a renormalization chain arising in search theory and the modelling of descent algorithms
- Analysis of the objective space in multiple objective linear programming
- A variable transformation method for solving linear absolute-value objective-function problems with linear constraints
- Shortest-path problems and molecular conformation
- Constraint propagation with interval labels
- On the Lyapunov stability of discrete-time processes modeled by difference inclusions
- A framework for finite strain elastoplasticity based on maximum plastic dissipation and the multiplicative decomposition. II: Computational aspects
- Models for petroleum field exploitation
- Optimization algorithms for a class of nonlinear programming problems
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- The conjugate point condition for smooth control sets
- On the convergence of reference point methods in multiobjective programming
- Interval Newton methods and perturbed problems
- A shape preserving interpolant with tension controls
- Optimality tests for fixed points of the fuzzy c-means algorithm
- Solving inequality constrained optimization problems by differential homotopy continuation methods
- Vehicles scheduling with sliding time windows
- Solving convex programming problems with equality constaints by neural networks
- Joint product durability and lot sizing models
- Solving a bilevel linear program when the inner decision maker control few variables
- The block conjugate gradient algorithm and related methods
- The ultimate-sustainable-yield problem in nonlinear age-structured populations
- Between Newton and Cauchy: the diagonal variable metric method; theory and test results
- Lexocographic multipliers
- An algorithm for the minimax Weber problem
- A new test for D-stability
- Minimization approach to limit solutions of plates
- Parallel algorithms for solving systems of nonlinear equations
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
- On reducing time spent in M/G/1 systems
- Constrained optimization along geodesics
- On Penalty methods for interelement constraints
- DELIGHT struct.: An optimization-based computer-aided design environment for structural engineering
- Optimality tests for partitioning and sectional search algorithms
- Lexicographic geometric programming
- On the convex programming approach to linear programming
- Systematic choice of initial points in local search: Extensions and application to neural networks
- Generalized QR factorization and its applications
- On linear programming and robust model-predictive control using impulse- respons-es
- A representation of the set of feasible objectives in multiple objective linear programs
- Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method
- An exact penalty algorithm for recourse-constrained stochastic linear programs
- Artificial neural networks in process estimation and control
- Multiple-objective programming with polynomial objectives and constraints
- Gauss-Seidel-Newton-Armijo approach for minimization problems on the non- negative orthant. Application to spatial price equilibrium problems
- Fast linear system solution by neural networks
- On a stress resultant geometrically exact shell model. Part V: Nonlinear plasticity: Formulation and integration algorithms
- On stabilization by means of the Energy-Casimir method
- On the economic lot scheduling problem with backlogging: The common cycle approach
- Recurrent neural networks for linear programming: Analysis and design principles
- Quasi-incompressible finite elasticity in principal stretches. Continuum basis and numerical algorithms
- Associative coupled thermoplasticity at finite strains: Formulation, numerical analysis and implementation
- Multiplier methods: A survey
- Minimization methods with constraints
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Optimal impulsive trajectory rendezvous by mathematical programming
- The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints
- On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm
- Mixed finite element methods - reduced and selective integration techniques: a unification of concepts
- Elastoplastic torsion by quadratic programming
- Large-scale problem analysis and decomposition theory
- Optimal harvesting of structured populations
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis
- An algorithm for optimal decentralized regulation of linear quadratic interconnected systems
- An exact penalty function algorithm for solving general constrained parameter optimization problems
- Finding the closest point to the origin in the convex hull of a discrete set of points
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
- Complementary mixed finite element formulations for elastoplasticity
- Determination of the portfolio selection for a property-liability insurance company
- Conditional subgradient optimization -- theory and applications
- Implied constraints and an alternate unified development of nonlinear programming theory
- Adaptive finite element techniques for frictional contact problems involving large elastic strains
- A production lot size inventory model for deteriorating items and arbitrary production and demand rates
- An optimal \((Q,r)\) policy for a multipart assembly system under stochastic part procurement lead times
- Tools for interactive multiattribute decision making with incompletely identified information
- Optimization of a nonlinear dynamical system for global climate change
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- A new penalty function algorithm for convex quadratic programming
This page was built for publication: An approach to nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553907)