On the public citation graph

Nonlinear Programming

https://doi.org/10.2307/2005896

0 signed · 260 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4668409openalex-extracted

inferred← citeshttps://doi.org/10.1002/nav.3800240214openalex-snapshot

The divisionalized firm revisited—A comment on Enzer's “the static theory of transfer pricing”

inferred← citeshttps://doi.org/10.1007/0-387-23081-5_10openalex-snapshot

On the Mathematical Foundation of MACBETH

inferred← citeshttps://doi.org/10.1007/0-387-23639-2_19openalex-snapshot

New Generalized Invexity for Duality in Multiobjective Programming Problems Involving N-Set Functions

inferred← citeshttps://doi.org/10.1007/0-387-23639-2_8openalex-snapshot

Duality in Fractional Programming Problems with Set Constraints

inferred← citeshttps://doi.org/10.1007/978-0-387-72778-3_2openalex-snapshot

Nonlinear Programming and Discrete-Time Optimal Control

inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_176openalex-snapshot

Farkas Lemma: Generalizations

inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_202openalex-snapshot

Generalized Concavity in Multi-objective Optimization

inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_526openalex-snapshot

Probabilistic Constrained Linear Programming: Duality Theory

inferred← citeshttps://doi.org/10.1007/978-0-387-89552-9_2openalex-snapshot

Kuhn–Tucker Conditions

inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_1openalex-snapshot

Are Generalized Derivatives Sseful for Generalized Convex Functions?

inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_17openalex-snapshot

Higher Order Invexity and Duality in Mathematical Programming

inferred← citeshttps://doi.org/10.1007/978-1-4615-0479-5_2openalex-snapshot

An Introduction to Optimization Theory

inferred← citeshttps://doi.org/10.1007/978-1-4615-0479-5_7openalex-snapshot

Nonlinear Optimization

inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_6openalex-snapshot

Complementarity Problems

inferred← citeshttps://doi.org/10.1007/978-1-4684-7600-2_3openalex-snapshot

Generalized Concavity

inferred← citeshttps://doi.org/10.1007/978-1-4684-7600-2_7openalex-snapshot

Fractional Programming

inferred← citeshttps://doi.org/10.1007/978-1-4684-7600-2_9openalex-snapshot

Additional Generalizations of Concavity

inferred← citeshttps://doi.org/10.1007/978-1-4684-8395-6_3openalex-snapshot

Pareto Optimal or Efficient Solutions

inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_19openalex-snapshot

Hierarchical Systems with Weighted Reaction Set

inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_2openalex-snapshot

On Regularity for Generalized Systems and Applications

inferred← citeshttps://doi.org/10.1007/978-1-4899-3734-6_2openalex-snapshot

Numerically Analyzing Linear Multicriteria Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-1-4899-7594-2_2openalex-snapshot

Elements of Nonlinear Programming

inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_19openalex-snapshot

On Monotone Maps: Semidifferentiable Case

inferred← citeshttps://doi.org/10.1007/978-3-030-43169-3_23openalex-snapshot

Supplemental Material

inferred← citeshttps://doi.org/10.1007/978-3-031-25564-9_3openalex-snapshot

The Variational Inequality Formulation of Dynamic User Equilibria

inferred← citeshttps://doi.org/10.1007/978-3-031-50492-1_11openalex-snapshot

Fuzzy Optimization, Linear Programming, and Operations Research

inferred← citeshttps://doi.org/10.1007/978-3-0348-6322-3_4openalex-snapshot

Some Remarks on Hačijan’s Paper

inferred← citeshttps://doi.org/10.1007/978-3-0348-9297-1_14openalex-snapshot

On lower subdifferentiable functions

inferred← citeshttps://doi.org/10.1007/978-3-0348-9297-1_22openalex-snapshot

Duality in Generalized Fractional Programming

inferred← citeshttps://doi.org/10.1007/978-3-319-00293-4_1openalex-snapshot

Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview

inferred← citeshttps://doi.org/10.1007/978-3-319-08900-3_2openalex-snapshot

Duality for Scalar Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-08900-3_4openalex-snapshot

Vector Duality via Scalarization for Vector Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-08900-3_6openalex-snapshot

Vector Duality for Linear and Semidefinite Vector Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-63049-6_4openalex-snapshot

Classical Methods in Vector Optimization

inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_33openalex-snapshot

Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities

inferred← citeshttps://doi.org/10.1007/978-3-642-15883-4_10openalex-snapshot

Online Knowledge-Based Support Vector Machines

inferred← citeshttps://doi.org/10.1007/978-3-642-45527-8_4openalex-snapshot

Stability, Equality, Balance, and Multivariate Risk

inferred← citeshttps://doi.org/10.1007/978-3-642-46368-6_12openalex-snapshot

Duality in Multiple Objective Linear Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-46668-7_4openalex-snapshot

Lösungsmethoden

inferred← citeshttps://doi.org/10.1007/978-3-642-46709-7_3openalex-snapshot

Projectively-Convex Models in Economics

inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_1openalex-snapshot

Univex sets, functions and univex nonlinear programming

inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_26openalex-snapshot

Generalized concavity and optimality conditions in vector and scalar optimization

inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_11openalex-snapshot

Degeneracy, Normality, Stability in Mathematical Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-73370-3_2openalex-snapshot

A Reconsideration of Debreu’s “Coefficient of Resource Utilization”

inferred← citeshttps://doi.org/10.1007/978-3-642-73778-7_5openalex-snapshot

Numerical Methods for Nonlinear Programming Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-77162-0_5openalex-snapshot

Nichtlineare Programmierung

inferred← citeshttps://doi.org/10.1007/978-3-642-78508-5_34openalex-snapshot

An Approach to Optimality Conditions in Vector and Scalar Optimization

inferred← citeshttps://doi.org/10.1007/978-3-642-82712-9_4openalex-snapshot

Lattice Statics

inferred← citeshttps://doi.org/10.1007/978-3-662-00427-2_7openalex-snapshot

Literaturverzeichnis

inferred← citeshttps://doi.org/10.1007/978-3-662-02529-1_4openalex-snapshot

Global Asymptotic Stability and Existence of Optimal Trajectories for Infinite Horizon Autonomous Convex Systems

inferred← citeshttps://doi.org/10.1007/978-3-662-12273-0_6openalex-snapshot

Primal-Dual Pairs

inferred← citeshttps://doi.org/10.1007/978-3-662-47241-5_74openalex-snapshot

Optimisation of Inclination for the Productivity in HTHP Slanted Well

inferred← citeshttps://doi.org/10.1007/978-3-7091-2618-9_7openalex-snapshot

Complementarity Problems and Unilateral Constraints

inferred← citeshttps://doi.org/10.1007/978-81-322-2452-5_3openalex-snapshot

A Study of Generalized Invex Functions on Riemannian Manifold

inferred← citeshttps://doi.org/10.1007/978-94-009-5796-1_6openalex-snapshot

Fractional and complex programming

inferred← citeshttps://doi.org/10.1007/978-94-009-7901-7_12openalex-snapshot

Instant Optimization of Hydro Energy Storage Plants

inferred← citeshttps://doi.org/10.1007/978-94-010-1739-8_4openalex-snapshot

Stetigkeitseigenschaften von Optimierungsaufgaben und Lineare Tschebyscheff-Approximation

inferred← citeshttps://doi.org/10.1007/978-981-13-3107-7_9openalex-snapshot

Distribution of Factor Endowments and the Non-cooperative Provision of Public Inputs

inferred← citeshttps://doi.org/10.1007/978-981-16-1819-2_13openalex-snapshot

On Constraint Qualifications for Multiobjective Optimization Problems with Switching Constraints

inferred← citeshttps://doi.org/10.1007/bf00121269openalex-snapshot

Weak via strong Stackelberg problem: New results

inferred← citeshttps://doi.org/10.1007/bf00932486openalex-snapshot

Duality relationships for a nonlinear version of the generalized Neyman-Pearson problem

inferred← citeshttps://doi.org/10.1007/bf00932540openalex-snapshot

Second-order characterizations of pseudoconvex quadratic functions

inferred← citeshttps://doi.org/10.1007/bf00932635openalex-snapshot

The projection method of optimization applied to engineering plasticity problems

inferred← citeshttps://doi.org/10.1007/bf00932858openalex-snapshot

A globally convergent method for nonlinear programming

inferred← citeshttps://doi.org/10.1007/bf00933129openalex-snapshot

Characterization of optimality in convex programming without a constraint qualification

inferred← citeshttps://doi.org/10.1007/bf00933232openalex-snapshot

A system of inequalities and nondifferentiable mathematical programming

inferred← citeshttps://doi.org/10.1007/bf00933531openalex-snapshot

A convergence theory for a class of anti-jamming strategies

inferred← citeshttps://doi.org/10.1007/bf00933799openalex-snapshot

Sufficient conditions for preference optimality

inferred← citeshttps://doi.org/10.1007/bf00933877openalex-snapshot

Converse duality in Banach space

inferred← citeshttps://doi.org/10.1007/bf00934082openalex-snapshot

On proper and improper efficient solutions of optimal problems with multicriteria

inferred← citeshttps://doi.org/10.1007/bf00934130openalex-snapshot

Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem

inferred← citeshttps://doi.org/10.1007/bf00934288openalex-snapshot

Geometric programming with signomials

inferred← citeshttps://doi.org/10.1007/bf00934338openalex-snapshot

A maximization method for a class of quasiconcave programs

inferred← citeshttps://doi.org/10.1007/bf00934453openalex-snapshot

The structure of admissible points with respect to cone dominance

inferred← citeshttps://doi.org/10.1007/bf00934654openalex-snapshot

A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems

inferred← citeshttps://doi.org/10.1007/bf00934792openalex-snapshot

Existence of solutions of pseudoconcave inequalities

inferred← citeshttps://doi.org/10.1007/bf00934807openalex-snapshot

Nonlinear programming in locally convex spaces

inferred← citeshttps://doi.org/10.1007/bf00934938openalex-snapshot

On the cones of tangents with applications to mathematical programming

inferred← citeshttps://doi.org/10.1007/bf00935004openalex-snapshot

On the gradient-projection method for solving the nonsymmetric linear complementarity problem

inferred← citeshttps://doi.org/10.1007/bf00935361openalex-snapshot

Duality in generalized fractional programming via Farkas' lemma

inferred← citeshttps://doi.org/10.1007/bf00935548openalex-snapshot

Lagrange multiplier rules for extremals in linear spaces

inferred← citeshttps://doi.org/10.1007/bf00935621openalex-snapshot

A feasible conjugate-direction method to solve linearly constrained minimization problems

inferred← citeshttps://doi.org/10.1007/bf00938309openalex-snapshot

Sufficient optimality conditions and duality for a quasiconvex programming problem

inferred← citeshttps://doi.org/10.1007/bf00938539openalex-snapshot

Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications

inferred← citeshttps://doi.org/10.1007/bf00939137openalex-snapshot

Characterizations of efficient sets by constrained objectives

inferred← citeshttps://doi.org/10.1007/bf00939335openalex-snapshot

Saddle-point type optimality criteria for generalized fractional programming

inferred← citeshttps://doi.org/10.1007/bf00939543openalex-snapshot

Note on generalized convex functions

inferred← citeshttps://doi.org/10.1007/bf00939919openalex-snapshot

B-vex functions

inferred← citeshttps://doi.org/10.1007/bf00939933openalex-snapshot

On a Lagrangian sufficient optimality condition

inferred← citeshttps://doi.org/10.1007/bf00940006openalex-snapshot

Generalized fractional programming duality: A parametric approach

inferred← citeshttps://doi.org/10.1007/bf00940494openalex-snapshot

Probabilistic constraints in primal and dual linear programs: Duality results

inferred← citeshttps://doi.org/10.1007/bf00940575openalex-snapshot

A generalization of a minimax theorem of Fan via a theorem of the alternative

inferred← citeshttps://doi.org/10.1007/bf00940768openalex-snapshot

On the reciprocal vector optimization problems

inferred← citeshttps://doi.org/10.1007/bf00941055openalex-snapshot

A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary

inferred← citeshttps://doi.org/10.1007/bf00941071openalex-snapshot

Nondifferentiable fractional programming with Hanson-Mond classes of functions

inferred← citeshttps://doi.org/10.1007/bf00941159openalex-snapshot

Iterative linear programming solution of convex programs

inferred← citeshttps://doi.org/10.1007/bf00941163openalex-snapshot

Least elements revisited

inferred← citeshttps://doi.org/10.1007/bf00941180openalex-snapshot

A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

inferred← citeshttps://doi.org/10.1007/bf00941316openalex-snapshot

The essence of invexity

inferred← citeshttps://doi.org/10.1007/bf00941889openalex-snapshot

Optimality conditions and duality in subdifferentiable multiobjective fractional programming

inferred← citeshttps://doi.org/10.1007/bf00941891openalex-snapshot

On strong pseudomonotonicity and (semi)strict quasimonotonicity

inferred← citeshttps://doi.org/10.1007/bf00966444openalex-snapshot

Some applications of mathematical programming to problems in mathematical physics

inferred← citeshttps://doi.org/10.1007/bf01096681openalex-snapshot

Misclassification minimization

inferred← citeshttps://doi.org/10.1007/bf01197553openalex-snapshot

The borel transform in Euclidean ? v 4 local existence for Rev < 4

inferred← citeshttps://doi.org/10.1007/bf01217689openalex-snapshot

Upper-semi-continuity and cone-concavity of multi-valued vector functions in a duality theory for vector optimization

inferred← citeshttps://doi.org/10.1007/bf01262931openalex-snapshot

On functions whose local minima are global

inferred← citeshttps://doi.org/10.1007/bf01262976openalex-snapshot

Nondifferentiable mathematical programming and convex-concave functions

inferred← citeshttps://doi.org/10.1007/bf01395812openalex-snapshot

An algorithm for discrete linearL p approximation

inferred← citeshttps://doi.org/10.1007/bf01397884openalex-snapshot

�ber die globale Konvergenz von Variable-Metrik-Verfahren mit nicht-exakter Schrittweitenbestimmung

inferred← citeshttps://doi.org/10.1007/bf01442883openalex-snapshot

Reverse convex programming

inferred← citeshttps://doi.org/10.1007/bf01580110openalex-snapshot

Stability of the solution of definite quadratic programs

inferred← citeshttps://doi.org/10.1007/bf01580366openalex-snapshot

Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems

inferred← citeshttps://doi.org/10.1007/bf01580452openalex-snapshot

Degeneracy in fixed cost transportation problems

inferred← citeshttps://doi.org/10.1007/bf01580588openalex-snapshot

A nonlinear equation for linear programming

inferred← citeshttps://doi.org/10.1007/bf01580666openalex-snapshot

Explicit duality for convex homogeneous programs

inferred← citeshttps://doi.org/10.1007/bf01580673openalex-snapshot

Quadratic duality over convex cone domains

inferred← citeshttps://doi.org/10.1007/bf01582015openalex-snapshot

On extremal points of quasiconvex functions

inferred← citeshttps://doi.org/10.1007/bf01582066openalex-snapshot

Global minimization by reducing the duality gap

inferred← citeshttps://doi.org/10.1007/bf01582229openalex-snapshot

An interior-point method for fractional programs with convex constraints

inferred← citeshttps://doi.org/10.1007/bf01582265openalex-snapshot

CP-rays in simplicial cones

inferred← citeshttps://doi.org/10.1007/bf01584083openalex-snapshot

On the solution of linear equation/inequality systems

inferred← citeshttps://doi.org/10.1007/bf01584095openalex-snapshot

Applications of symmetric derivatives in mathematical programming

inferred← citeshttps://doi.org/10.1007/bf01584322openalex-snapshot

Optimality condition: Constraint regularization

inferred← citeshttps://doi.org/10.1007/bf01585749openalex-snapshot

Generalized linear complementarity problems

inferred← citeshttps://doi.org/10.1007/bf01588783openalex-snapshot

OnQ-matrices

inferred← citeshttps://doi.org/10.1007/bf01593799openalex-snapshot

Generalization of some duality theorems in nonlinear programming

inferred← citeshttps://doi.org/10.1007/bf01666520openalex-snapshot

Optimality conditions for global optimization (I)

inferred← citeshttps://doi.org/10.1007/bf01681343openalex-snapshot

A finite algorithm to maximize certain pseudoconcave functions on polytopes

inferred← citeshttps://doi.org/10.1007/bf01720206openalex-snapshot

Eine Charakterisierung der Unterhalbstetigkeit von Restriktionsmengen

inferred← citeshttps://doi.org/10.1007/bf01874130openalex-snapshot

Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces

inferred← citeshttps://doi.org/10.1007/bf01920307openalex-snapshot

Generalized concavity of a function in portfolio theory

inferred← citeshttps://doi.org/10.1007/bf01957169openalex-snapshot

Sufficient optimality criteria in non-linear programming in the presence of convex equality and inequality constraints

inferred← citeshttps://doi.org/10.1007/bf02091665openalex-snapshot

Nuove classi di funzioni scalari concave generalizzate

inferred← citeshttps://doi.org/10.1007/bf02186473openalex-snapshot

Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs

inferred← citeshttps://doi.org/10.1007/bf02192647openalex-snapshot

Coercivity and image of constrained extremum problems

inferred← citeshttps://doi.org/10.1007/bf02196597openalex-snapshot

On invexity-type nonlinear programming problems

inferred← citeshttps://doi.org/10.1007/bf02282058openalex-snapshot

Optimal consumption and arbitrage in incomplete, finite state security markets

inferred← citeshttps://doi.org/10.1007/bf02346160openalex-snapshot

On the exactness of a class of nondifferentiable penalty functions

inferred← citeshttps://doi.org/10.1007/bf02576169openalex-snapshot

Quasi-convex programming revisited

inferred← citeshttps://doi.org/10.1007/bf02591908openalex-snapshot

Duality in generalized linear fractional programming

inferred← citeshttps://doi.org/10.1007/bf02592952openalex-snapshot

Bifurcation problems in nonlinear parametric programming

inferred← citeshttps://doi.org/10.1007/bf02612363openalex-snapshot

Pseudolinearity and efficiency

inferred← citeshttps://doi.org/10.1007/bf02935737openalex-snapshot

Generalized invexity and duality in multiobjective nonlinear programming

inferred← citeshttps://doi.org/10.1007/bf02936067openalex-snapshot

On variational problems involving higher order derivatives

inferred← citeshttps://doi.org/10.1007/bf02936579openalex-snapshot

On fractional programming containing support functions

inferred← citeshttps://doi.org/10.1007/bf03398571openalex-snapshot

On Mixed Symmetric Duality in Mathematical Programming

inferred← citeshttps://doi.org/10.1007/bf03398671openalex-snapshot

The Pre-Variational Problems and the Constrained Mathematical Programming Problem

inferred← citeshttps://doi.org/10.1007/bf03398695openalex-snapshot

Partial Vector Invexity And Fractional Minmax Problems

inferred← citeshttps://doi.org/10.1007/bfb0035468openalex-snapshot

A numerical approach to the design of masonry structures

inferred← citeshttps://doi.org/10.1007/bfb0059454openalex-snapshot

Comments on the problems

inferred← citeshttps://doi.org/10.1007/bfb0076712openalex-snapshot

Some applications of penalty functions in mathematical programming

inferred← citeshttps://doi.org/10.1007/bfb0120783openalex-snapshot

Characterization of linear complementarity problems as linear programs

inferred← citeshttps://doi.org/10.1007/bfb0120980openalex-snapshot

Sufficient conditions for a globally exact penalty function without convexity

inferred← citeshttps://doi.org/10.1007/bfb0120987openalex-snapshot

Characterizations of bounded solutions of linear complementarity problems

inferred← citeshttps://doi.org/10.1007/s00186-005-0013-9openalex-snapshot

On sufficient second order optimality conditions in multiobjective optimization

inferred← citeshttps://doi.org/10.1007/s00199-007-0225-8openalex-snapshot

Competitive prices for a stochastic input–output model with infinite time horizon

inferred← citeshttps://doi.org/10.1007/s00454-004-1118-2openalex-snapshot

High-Dimensional Shape Fitting in Linear Time

inferred← citeshttps://doi.org/10.1007/s10255-006-6049-7openalex-snapshot

Necessary optimality conditions for a class of nonsmooth vector optimization

inferred← citeshttps://doi.org/10.1007/s10479-008-0346-xopenalex-snapshot

A graphical characterization of the efficient set for convex multiobjective problems

inferred← citeshttps://doi.org/10.1007/s10479-017-2604-2openalex-snapshot

Angle-based twin support vector machine

inferred← citeshttps://doi.org/10.1007/s10479-023-05368-5openalex-snapshot

On directionally differentiable multiobjective programming problems with vanishing constraints

inferred← citeshttps://doi.org/10.1007/s10489-017-1131-9openalex-snapshot

The neuro-dynamic scheme for solving general form of discrete time optimal control problems

inferred← citeshttps://doi.org/10.1007/s10665-023-10315-1openalex-snapshot

Optimal linear tracking for a hidden target on one of K-intervals

inferred← citeshttps://doi.org/10.1007/s10898-004-8266-zopenalex-snapshot

A Smoothing Newton Method for Semi-Infinite Programming

inferred← citeshttps://doi.org/10.1007/s10898-008-9299-5openalex-snapshot

On G-invex multiobjective programming. Part I. Optimality

inferred← citeshttps://doi.org/10.1007/s10898-008-9377-8openalex-snapshot

Optimality and duality for nonsmooth multiobjective programming problems with V-r-invexity

inferred← citeshttps://doi.org/10.1007/s10898-012-9956-6openalex-snapshot

Characterizations of pseudoconvex functions and semistrictly quasiconvex ones

inferred← citeshttps://doi.org/10.1007/s10898-015-0367-3openalex-snapshot

A scalarization proximal point method for quasiconvex multiobjective minimization

inferred← citeshttps://doi.org/10.1007/s10898-019-00787-wopenalex-snapshot

A new algorithm for concave quadratic programming

inferred← citeshttps://doi.org/10.1007/s10898-024-01415-yopenalex-snapshot

Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach

inferred← citeshttps://doi.org/10.1007/s10957-004-1840-1openalex-snapshot

Some Extensions of Nonconvex Economic Modeling: Invexity, Quasimax, and New Stability Conditions

inferred← citeshttps://doi.org/10.1007/s10957-005-6550-9openalex-snapshot

Stronger Kuhn-Tucker Type Conditions in Nonsmooth Multiobjective Optimization: Locally Lipschitz Case

inferred← citeshttps://doi.org/10.1007/s10957-006-9141-5openalex-snapshot

Continuous Modular Design Problem: Analysis and Solution Algorithms

inferred← citeshttps://doi.org/10.1007/s10957-007-9242-9openalex-snapshot

New Results on Second-Order Optimality Conditions in Vector Optimization Problems

inferred← citeshttps://doi.org/10.1007/s10957-010-9671-8openalex-snapshot

Constant-Rank Condition and Second-Order Constraint Qualification

inferred← citeshttps://doi.org/10.1007/s10957-012-0123-5openalex-snapshot

Duality and a Characterization of Pseudoinvexity for Pareto and Weak Pareto Solutions in Nondifferentiable Multiobjective Programming

inferred← citeshttps://doi.org/10.1007/s10957-020-01678-xopenalex-snapshot

Nonsingularity and Stationarity Results for Quasi-Variational Inequalities

inferred← citeshttps://doi.org/10.1007/s11044-012-9317-8openalex-snapshot

Inertial couplings between unilateral and bilateral holonomic constraints in frictionless Lagrangian systems

inferred← citeshttps://doi.org/10.1007/s11123-011-0247-xopenalex-snapshot

The measurement of productivity in the nonmarket sector

inferred← citeshttps://doi.org/10.1007/s11228-012-0211-6openalex-snapshot

Infinite Alternative Theorems and Nonsmooth Constraint Qualification Conditions

inferred← citeshttps://doi.org/10.1007/s11228-016-0360-0openalex-snapshot

Variational Analysis on Local Sharp Minima via Exact Penalization

inferred← citeshttps://doi.org/10.1007/s11425-016-5147-0openalex-snapshot

Second order duality for multiobjective programming with cone constraints

inferred← citeshttps://doi.org/10.1007/s11590-012-0507-3openalex-snapshot

Symmetric duality for second-order fractional programs

inferred← citeshttps://doi.org/10.1007/s11590-012-0512-6openalex-snapshot

Duality in nonlinear programming

inferred← citeshttps://doi.org/10.1007/s11590-019-01482-1openalex-snapshot

Feature selection in SVM via polyhedral k-norm

inferred← citeshttps://doi.org/10.1007/s11750-008-0058-zopenalex-snapshot

Strong Kuhn–Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems

inferred← citeshttps://doi.org/10.1007/s11750-014-0319-yopenalex-snapshot

Farkas’ lemma: three decades of generalizations for mathematical optimization

inferred← citeshttps://doi.org/10.1007/s12190-008-0080-1openalex-snapshot

Sufficient Conditions and Duality for a Class of Multiobjective Fractional Programming Problems with Higher-Order (F,α,ρ,d)-Convexity

inferred← citeshttps://doi.org/10.1007/s12190-012-0566-8openalex-snapshot

Multiobjective programming problems with (G,C,ρ)-convexity

inferred← citeshttps://doi.org/10.1007/s12597-018-0337-xopenalex-snapshot

Decomposition of parametric space for bi-objective optimization problem using neural network approach

inferred← citeshttps://doi.org/10.1007/s12597-021-00512-wopenalex-snapshot

Generation of some methods for solving interval multi-objective linear programming models

inferred← citeshttps://doi.org/10.1007/s12597-023-00670-zopenalex-snapshot

Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality

inferred← citeshttps://doi.org/10.1007/s13235-017-0218-6openalex-snapshot

Potential Differential Games

inferred← citeshttps://doi.org/10.1007/s40819-021-01002-9openalex-snapshot

Duality in Multiobjective Mathematical Programs with Equilibrium Constraints

inferred← citeshttps://doi.org/10.1007/s41060-023-00472-yopenalex-snapshot

Oblique random forests with binary and ternary decision structures and non-parallel hyperplanes classifiers

inferred← citeshttps://doi.org/10.1016/0041-5553(70)90078-9openalex-snapshot

An algorithm of descent with constraints

inferred← citeshttps://doi.org/10.1016/0041-5553(79)90067-3openalex-snapshot

Methods for solving constrained extremum problems in the presence of random noise

inferred← citeshttps://doi.org/10.1016/0041-5553(90)90003-bopenalex-snapshot

The direct Lyapunov method in investigating the attraction of trajectories of finite-difference inclusions

inferred← citeshttps://doi.org/10.1016/j.ins.2018.06.007openalex-snapshot

Insensitive stochastic gradient twin support vector machines for large scale problems

showing the first 200 of 260 · page through all 260

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.